A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
From MaRDI portal
Publication:3581567
DOI10.1145/1109557.1109689zbMath1192.68173OpenAlexW4240527869MaRDI QIDQ3581567
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109689
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (6)
Dynamic coresets ⋮ Efficient independent set approximation in unit disk graphs ⋮ Kinetic Euclidean minimum spanning tree in the plane ⋮ On bounded leg shortest paths problems ⋮ Stable roommates spanner ⋮ Multi Cover of a Polygon Minimizing the Sum of Areas
Uses Software
This page was built for publication: A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
