Kinetic Reverse k-Nearest Neighbor Problem

DOI10.1007/978-3-319-19315-1_27zbMath1401.68352arXiv1406.5554OpenAlexW2115185960MaRDI QIDQ2946067

Valerie King, Zahed Rahmati, S. H. Whitesides

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.5554

zbMATH Keywords

\(k\)-nearest neighborskinetic data structurecontinuous monitoringmoving pointscontinuous queriesreverse \(k\)-nearest neighbor query

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Kinetic \(k\)-semi-Yao graph and its applications

Cites Work

• Kinetic spanners in \(\mathbb R^{d}\)
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Algorithms for proximity problems in higher dimensions
• A simple, faster method for kinetic proximity problems
• On levels in arrangements of curves. II: A simple inequality and its consequences
• REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• On levels in arrangements of curves, iii
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Unnamed Item