Kinetic and dynamic data structures for closest pair and all nearest neighbors

DOI10.1145/1435375.1435379zbMath1445.68059OpenAlexW2115704441MaRDI QIDQ4962762

Haim Kaplan, Micha Sharir, Pankaj K. Agarwal

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

computational geometrykinetic data structuresnearest neighborsclosest pair

Mathematics Subject Classification ID

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

Related Items (11)

Kinetic \(k\)-semi-Yao graph and its applications ⋮ Kinetic Reverse k-Nearest Neighbor Problem ⋮ Kinetic Euclidean minimum spanning tree in the plane ⋮ A kinetic triangulation scheme for moving points in the plane ⋮ Approximate $k$-Nearest Neighbor Graph on Moving Points ⋮ Stable Delaunay graphs ⋮ Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points ⋮ A clustering-based approach to kinetic closest pair ⋮ Agglomerative clustering of growing squares ⋮ Unnamed Item ⋮ A simple, faster method for kinetic proximity problems

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