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

DOI10.1145/2462356.2462378MaRDI QIDQ5174471zbMATH OpenOpenAlexWikidataFDO

Authors Zahed Rahmati, Valerie King, Sue 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

all nearest neighborsclosest pairDelaunay triangulationkinetic algorithmPie Delaunay graphtheta graph

Mathematics Subject Classification ID

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

Recommendations

• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Dynamic data structures for \(k\)-nearest neighbor queries
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Algorithms and Data Structures
• Kinetic reverse \(k\)-nearest neighbor problem
• scientific article; zbMATH DE number 437555
• Randomized Data Structures for the Dynamic Closest-Pair Problem
• Kinetic KD-trees and longest-side KD-trees
• Kinetic kd-trees and longest-side kd-trees

Cited in

(7)

• Kinetic \(k\)-semi-Yao graph and its applications
• A simple, faster method for kinetic proximity problems
• Kinetic reverse \(k\)-nearest neighbor problem
• Data Structures for Mobile Data
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Approximate $k$-Nearest Neighbor Graph on Moving Points
• A clustering-based approach to kinetic closest pair

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174471)