Point location in fat subdivisions

DOI10.1016/0020-0190(92)90211-DzbMath0795.68188MaRDI QIDQ1209353

Mark H. Overmars

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational geometrypoint location problemsubdivisions

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Range searching in low-density environments ⋮ 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects ⋮ On fat partitioning, fat covering and the union size of polygons ⋮ Linear size binary space partitions for fat objects ⋮ Spheres, molecules, and hidden surface removal ⋮ Dynamic data structures for fat objects and their applications ⋮ The complexity of the free space for motion planning amidst fat obstacles ⋮ Approximate range searching ⋮ The complexity of the free space for a robot moving amidst fat obstacles

Cites Work

• Unnamed Item
• Bounded ordered dictionaries in O(log log N) time and O(n) space
• Fractional cascading. I: A data structuring technique
• The complexity of the free space for a robot moving amidst fat obstacles
• PLANAR POINT LOCATION REVISITED
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Fat Triangles Determine Linearly Many Holes
• Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions

This page was built for publication: Point location in fat subdivisions