28 search results - page 5 / 6 » Query-Sensitive Ray Shooting |
STOC
2003
ACM
14 years 5 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...
CRV
2008
IEEE
13 years 11 months ago
2008
IEEE
We propose a ray-based segmentation method for color images. A segment is represented by a centroid and evenlydistributed rays shooting out from it. First, a bottom-up low-level b...
GRAPHITE
2007
ACM
13 years 8 months ago
2007
ACM
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
IJCGA
2007
13 years 4 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...