Range searching in low-density environments
From MaRDI portal
Publication:1350104
DOI10.1016/S0020-0190(96)00154-8zbMath0875.68204OpenAlexW2099698406MaRDI QIDQ1350104
Otfried Schwarzkopf, Jules Vleugels
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00154-8
Related Items (10)
Models and motion planning ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects ⋮ On realistic terrains ⋮ Ray shooting and intersection searching amidst fat convex polyhedra in 3-space ⋮ Local polyhedra and geometric graphs ⋮ Efficient image retrieval through vantage objects ⋮ Models and motion planning ⋮ Smoothed analysis of probabilistic roadmaps ⋮ Dynamic data structures for fat objects and their applications
Cites Work
- Unnamed Item
- Efficient hidden surface removal for objects with small union size
- Point location in fat subdivisions
- On the union of fat wedges and separating a collection of segments by a line
- 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
- Range Searching and Point Location among Fat Objects
- Fat Triangles Determine Linearly Many Holes
- On fat partitioning, fat covering and the union size of polygons
This page was built for publication: Range searching in low-density environments