Point location in fat subdivisions
From MaRDI portal
Publication:1209353
DOI10.1016/0020-0190(92)90211-DzbMATH Open0795.68188MaRDI QIDQ1209353FDOQ1209353
Authors: Mark H. Overmars 
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
Cites Work
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Title not available (Why is that?)
- PLANAR POINT LOCATION REVISITED
- Fractional cascading. I: A data structuring technique
- The complexity of the free space for a robot moving amidst fat obstacles
- Fat Triangles Determine Linearly Many Holes
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
Cited In (13)
- Storing the subdivision of a polyhedral surface
- Two- and three- dimensional point location in rectangular subdivisions
- Dynamic data structures for fat objects and their applications
- Spheres, molecules, and hidden surface removal
- Range searching in low-density environments
- The complexity of the free space for a robot moving amidst fat obstacles
- Title not available (Why is that?)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Linear size binary space partitions for fat objects
- On fat partitioning, fat covering and the union size of polygons
- The complexity of the free space for motion planning amidst fat obstacles
- Approximate range searching
- Point Location in Incremental Planar Subdivisions.
This page was built for publication: Point location in fat subdivisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209353)
