Range searching in low-density environments
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4108220 (Why is no real title available?)
- Efficient hidden surface removal for objects with small union size
- Fat Triangles Determine Linearly Many Holes
- On fat partitioning, fat covering and the union size of polygons
- On the union of fat wedges and separating a collection of segments by a line
- Point location in fat subdivisions
- Range Searching and Point Location among Fat Objects
- The complexity of the free space for a robot moving amidst fat obstacles
- The complexity of the free space for motion planning amidst fat obstacles
Cited in
(11)- Efficient image retrieval through vantage objects
- Models and motion planning
- An optimal-time algorithm for shortest paths on realistic polyhedra
- On realistic terrains
- Dynamic data structures for fat objects and their applications
- Models and motion planning
- Approximating the \(\lambda \)-low-density value
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Local polyhedra and geometric graphs
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Smoothed analysis of probabilistic roadmaps
This page was built for publication: Range searching in low-density environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350104)