Range Searching and Point Location among Fat Objects
From MaRDI portal
Recommendations
Cited in
(23)- Models and motion planning
- On realistic terrains
- Approximating the packedness of polygonal curves
- Reprint of: Bounding the locus of the center of mass for a part with shape variation
- Dynamic data structures for fat objects and their applications
- Models and motion planning
- Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I: Algorithmic details
- Approximate center points in dense point sets
- Range searching in low-density environments
- Guarding scenes against invasive hypercubes.
- Bounding the locus of the center of mass for a part with shape variation
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- Walking around fat obstacles.
- Exact and approximation algorithms for computing optimal fat decompositions
- Local polyhedra and geometric graphs
- Approximate unions of lines and Minkowski sums
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Approximate range searching: The absolute model
- Smoothed analysis of probabilistic roadmaps
- Piercing pairwise intersecting convex shapes in the plane
- Point location in fat subdivisions
- Approximating the Packedness of Polygonal Curves
- Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects
This page was built for publication: Range Searching and Point Location among Fat Objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837391)
