Sciweavers

104 search results - page 2 / 21
» Intersecting convex sets by rays
Sort
View
ESA
2007
Springer
101views Algorithms» more  ESA 2007»
14 years 3 months ago
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
Haim Kaplan, Natan Rubin, Micha Sharir
COMBINATORICS
2004
108views more  COMBINATORICS 2004»
13 years 9 months ago
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
13 years 4 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
JAT
2006
64views more  JAT 2006»
13 years 9 months ago
A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert
A new iterative method for finding the projection onto the intersection of two closed convex sets in a Hilbert space is presented. It is a Haugazeau-like modification of a recentl...
Heinz H. Bauschke, Patrick L. Combettes, D. Russel...