Network Voronoi diagram on uncertain objects for nearest neighbor queries
From MaRDI portal
Publication:528745
DOI10.1016/J.INS.2014.12.050zbMATH Open1360.68878OpenAlexW1983667738MaRDI QIDQ528745FDOQ528745
Authors: Yanhong Li, Li Li, Guo-Hui Li, Jianjun Li
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.12.050
Recommendations
- On the most likely Voronoi diagram and nearest neighbor searching
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
- Conic nearest neighbor queries and approximate Voronoi diagrams
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
- Uncertain Voronoi diagram
- Reverse nearest neighbor queries using Voronoi diagrams
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
Cited In (7)
- A novel index method for \(K\) nearest object query over time-dependent road networks
- Voronoi-based range and continuous range query processing in mobile databases
- An indexing framework for queries on probabilistic graphs
- Uncertain Voronoi diagram
- Cost models for nearest neighbor query processing over existentially uncertain spatial data
- Nearest-neighbor searching under uncertainty. II
- Nearest neighbor query in road networks
This page was built for publication: Network Voronoi diagram on uncertain objects for nearest neighbor queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528745)