Kinetic and dynamic data structures for closest pair and all nearest neighbors
From MaRDI portal
Publication:4962762
DOI10.1145/1435375.1435379zbMATH Open1445.68059OpenAlexW2115704441MaRDI QIDQ4962762FDOQ4962762
Authors: Haim Kaplan, Pankaj K. Agarwal, Micha Sharir 
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
Recommendations
- Kinetic data structures for all nearest neighbors and closest pair in the plane
- Dynamic data structures for \(k\)-nearest neighbor queries
- scientific article; zbMATH DE number 437555
- Randomized Data Structures for the Dynamic Closest-Pair Problem
- scientific article; zbMATH DE number 437556
- Dynamic closest pairs — A probabilistic approach
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Algorithms and Data Structures
- Kinetic reverse \(k\)-nearest neighbor problem
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (18)
- Dynamic closest pairs — A probabilistic approach
- Kinetic \(k\)-semi-Yao graph and its applications
- Maintaining Reeb graphs of triangulated 2-manifolds
- A Clustering-Based Approach to Kinetic Closest Pair
- Kinetic reverse \(k\)-nearest neighbor problem
- Randomized Data Structures for the Dynamic Closest-Pair Problem
- A clustering-based approach to kinetic closest pair
- A simple, faster method for kinetic proximity problems
- Kinetic Euclidean minimum spanning tree in the plane
- Kinetic kd-trees and longest-side kd-trees
- Agglomerative clustering of growing squares
- A kinetic triangulation scheme for moving points in the plane
- Stable Delaunay graphs
- Deferred data structure for the nearest neighbor problem
- Approximate $k$-Nearest Neighbor Graph on Moving Points
- Kinetic data structures for all nearest neighbors and closest pair in the plane
- Kinetic KD-trees and longest-side KD-trees
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
This page was built for publication: Kinetic and dynamic data structures for closest pair and all nearest neighbors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962762)
