Approximate $k$-Nearest Neighbor Graph on Moving Points

DOI10.22108/toc.2022.130533.1943OpenAlexW4391059369MaRDI QIDQ5045992

Zahed Rahmati

Publication date: 8 November 2022

Full work available at URL: https://doaj.org/article/2083fc3d52ee472dbac8ddb7c661695a

zbMATH Keywords

approximationmoving points\(k\)-nearest neighbor graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Kinetic spanners in \(\mathbb R^{d}\)
• An O(n log n) algorithm for the all-nearest-neighbors problem
• On \(k\)-sets in arrangements of curves and surfaces
• On levels in arrangements of lines, segments, planes, and triangles
• Kinetic \(k\)-semi-Yao graph and its applications
• 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
• Kinetic Pie Delaunay Graph and Its Applications
• 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
• Kinetic data structures for all nearest neighbors and closest pair in the plane

This page was built for publication: Approximate $k$-Nearest Neighbor Graph on Moving Points