Range searching in low-density environments
From MaRDI portal
Publication:1350104
DOI10.1016/S0020-0190(96)00154-8zbMATH Open0875.68204OpenAlexW2099698406MaRDI QIDQ1350104FDOQ1350104
Authors: Otfried Cheong, 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
Recommendations
Cites Work
- Range Searching and Point Location among Fat Objects
- 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
- Fat Triangles Determine Linearly Many Holes
- The complexity of the free space for motion planning amidst fat obstacles
- On fat partitioning, fat covering and the union size of polygons
- Efficient hidden surface removal for objects with small union size
- Title not available (Why is that?)
- Point location in fat subdivisions
Cited In (11)
- 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
- Efficient image retrieval through vantage objects
- Models and motion planning
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)
