Range Searching and Point Location among Fat Objects
From MaRDI portal
Publication:3837391
DOI10.1006/jagm.1996.0063zbMath0864.68020OpenAlexW2087027878MaRDI QIDQ3837391
A. Frank van der Stappen, Mark H. Overmars
Publication date: 8 December 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/17327
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (21)
Models and motion planning ⋮ Approximate center points in dense point sets ⋮ Approximate unions of lines and Minkowski sums ⋮ Range searching in low-density environments ⋮ 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects ⋮ Exact and approximation algorithms for computing optimal fat decompositions ⋮ Piercing pairwise intersecting convex shapes in the plane ⋮ Guarding scenes against invasive hypercubes. ⋮ On realistic terrains ⋮ Ray shooting and intersection searching amidst fat convex polyhedra in 3-space ⋮ Approximating the Packedness of Polygonal Curves ⋮ Bounding the locus of the center of mass for a part with shape variation ⋮ Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I: Algorithmic details ⋮ Approximate range searching: The absolute model ⋮ Local polyhedra and geometric graphs ⋮ Models and motion planning ⋮ Smoothed analysis of probabilistic roadmaps ⋮ Dynamic data structures for fat objects and their applications ⋮ Approximating the packedness of polygonal curves ⋮ Walking around fat obstacles. ⋮ Reprint of: Bounding the locus of the center of mass for a part with shape variation
This page was built for publication: Range Searching and Point Location among Fat Objects
