8 search results - page 1 / 2 » Ray Shooting in Polygons Using Geodesic Triangulations |
ICALP
1991
Springer
13 years 9 months ago
1991
Springer
COMGEO
2002
ACM
13 years 6 months ago
2002
ACM
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 ...
COMPGEOM
2009
ACM
14 years 23 days ago
2009
ACM
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...
LATIN
2004
Springer
13 years 11 months ago
2004
Springer
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...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...