Approximate k-Nearest Neighbor Graph on Moving Points
From MaRDI portal
Publication:5045992
DOI10.22108/TOC.2022.130533.1943OpenAlexW4391059369MaRDI QIDQ5045992FDOQ5045992
Publication date: 8 November 2022
Full work available at URL: https://doaj.org/article/2083fc3d52ee472dbac8ddb7c661695a
Recommendations
- scientific article; zbMATH DE number 1832323
- Graph-based time-space trade-offs for approximate near neighbors
- Approximate nearest neighbor search in metrics of planar graphs
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
- On nearest-neighbor graphs
- On nearest-neighbor graphs
- Sublinear time approximation of the cost of a metric k-nearest neighbor graph
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Analysis of algorithms (68W40)
Cites Work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Computational geometry. Algorithms and applications.
- On levels in arrangements of lines, segments, planes, and triangles
- An O(n log n) algorithm for the all-nearest-neighbors problem
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Algorithms for proximity problems in higher dimensions
- On levels in arrangements of curves. II: A simple inequality and its consequences
- On levels in arrangements of curves, iii
- Title not available (Why is that?)
- Kinetic spanners in \(\mathbb R^{d}\)
- On \(k\)-sets in arrangements of curves and surfaces
- Kinetic and dynamic data structures for closest pair and all nearest neighbors
- A simple, faster method for kinetic proximity problems
- Kinetic Pie Delaunay Graph and Its Applications
- Kinetic \(k\)-semi-Yao graph and its applications
- Kinetic data structures for all nearest neighbors and closest pair in the plane
Cited In (1)
This page was built for publication: Approximate $k$-Nearest Neighbor Graph on Moving Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045992)
