REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
From MaRDI portal
Publication:2999092
DOI10.1142/S0218195911003603zbMATH Open1216.65023MaRDI QIDQ2999092FDOQ2999092
Authors: Antoine Vigneron, Juyoung Yon, Otfried Cheong
Publication date: 11 May 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
Cites Work
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Semi-Online Maintenance of Geometric Optima and Measures
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- Well-separated pair decomposition in linear time?
- Dynamic half-space range reporting and its applications
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- Space-time tradeoffs for approximate nearest neighbor searching
Cited In (7)
- Facility location problems in the plane based on reverse nearest neighbor queries
- Kinetic \(k\)-semi-Yao graph and its applications
- Reverse nearest neighbor queries using Voronoi diagrams
- On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
- Kinetic reverse \(k\)-nearest neighbor problem
- Continuous visible reverse nearest neighbor queries in spatial databases
- A reverse nearest neighbor search algorithm in metric space
This page was built for publication: REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999092)