Point location in fat subdivisions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Bounded ordered dictionaries in O(log log N) time and O(n) space
- Fat Triangles Determine Linearly Many Holes
- Fractional cascading. I: A data structuring technique
- PLANAR POINT LOCATION REVISITED
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- The complexity of the free space for a robot moving amidst fat obstacles
- Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
Cited in
(14)- Range Searching and Point Location among Fat Objects
- 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
- scientific article; zbMATH DE number 140454 (Why is no real title available?)
- 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)
