Dynamic data structures for fat objects and their applications

DOI10.1016/S0925-7721(99)00059-0zbMath0952.68147MaRDI QIDQ1975962

Matthew J. Katz, Frank Nielsen, Alon Efrat, Micha Sharir

Publication date: 8 May 2000

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

point-enclosure queries

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (10)

Models and motion planning ⋮ Generalized disk graphs ⋮ Approximate unions of lines and Minkowski sums ⋮ Exact and approximation algorithms for computing optimal fat decompositions ⋮ A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space ⋮ SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS ⋮ Approximation algorithms for maximum independent set of pseudo-disks ⋮ Polynomial-time approximation schemes for piercing and covering with applications in wireless networks ⋮ Contraction and expansion of convex sets ⋮ Fast stabbing of boxes in high dimensions

Uses Software

• Hull

This page was built for publication: Dynamic data structures for fat objects and their applications