Kinetic \(k\)-semi-Yao graph and its applications
From MaRDI portal
Publication:1622343
DOI10.1016/j.comgeo.2015.11.001zbMath1506.68018arXiv1412.5697OpenAlexW2962699613MaRDI QIDQ1622343
Valerie King, Zahed Rahmati, Mohammad Ali Abam, S. H. Whitesides
Publication date: 19 November 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5697
\(k\)-nearest neighborskinetic data structurecontinuous monitoringcontinuous queriesreverse \(k\)-nearest neighbor queries
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kinetic spanners in \(\mathbb R^{d}\)
- An O(n log n) algorithm for the all-nearest-neighbors problem
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Euclidean minimum spanning trees and bichromatic closest pairs
- On \(k\)-sets in arrangements of curves and surfaces
- On levels in arrangements of lines, segments, planes, and triangles
- 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 Reverse k-Nearest Neighbor Problem
- REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- On levels in arrangements of curves, iii
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- 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
- Sharp bounds on Davenport-Schinzel sequences of every order
- Orthogonal range searching on the RAM, revisited
