Sciweavers

28 search results - page 2 / 6
» Query-Sensitive Ray Shooting
Sort
View
LATIN
2004
Springer
13 years 10 months ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
Hervé Brönnimann, Marc Glisse
COMGEO
2006
ACM
13 years 4 months ago
Cost prediction for ray shooting in octrees
The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics. Unfortunately, theoretical solutions to the problem are not ver...
Boris Aronov, Hervé Brönnimann, Allen ...
ESA
2007
Springer
101views Algorithms» more  ESA 2007»
13 years 10 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
COMPGEOM
2009
ACM
13 years 11 months ago
Shooting permanent rays among disjoint polygons in the plane
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
Mashhood Ishaque, Bettina Speckmann, Csaba D. T&oa...
COMGEO
2002
ACM
13 years 4 months ago
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
Siu-Wing Cheng, Kam-Hing Lee