Kinetic data structures for all nearest neighbors and closest pair in the plane

DOI10.1145/2462356.2462378zbMath1305.68070OpenAlexW2015391423WikidataQ29396262 ScholiaQ29396262MaRDI QIDQ5174471

Valerie King, Zahed Rahmati, S. H. Whitesides

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2462356.2462378

zbMATH Keywords

Delaunay triangulationtheta graphclosest pairall nearest neighborskinetic algorithmPie Delaunay graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (2)

Approximate $k$-Nearest Neighbor Graph on Moving Points ⋮ A simple, faster method for kinetic proximity problems

This page was built for publication: Kinetic data structures for all nearest neighbors and closest pair in the plane