Nearest-neighbor searching under uncertainty. I

DOI10.1007/s00454-017-9903-xzbMath1380.68163OpenAlexW2731672939MaRDI QIDQ2411831

Swaminathan Sankararaman, Wuzhou Zhang, Alon Efrat, Pankaj K. Agarwal

Publication date: 25 October 2017

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-017-9903-x

zbMATH Keywords

nearest-neighbor queriesapproximate nearest neighbor (ANN)queries on uncertain data

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (13)

Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points ⋮ Computing the Center of Uncertain Points on Tree Networks ⋮ Convex hulls under uncertainty ⋮ Fréchet Distance for Uncertain Curves ⋮ r-Gatherings on a star and uncertain r-gatherings on a line ⋮ On the Most Likely Voronoi Diagram and Nearest Neighbor Searching ⋮ Range-max queries on uncertain data ⋮ Computing the center of uncertain points on tree networks ⋮ Unnamed Item ⋮ Covering uncertain points in a tree ⋮ On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane ⋮ Approximating Minimization Diagrams and Generalized Proximity Search ⋮ Expected computations on color spanning sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Managing and mining uncertain data
• Uncertain Voronoi diagram
• Fractional cascading. I: A data structuring technique
• Making data structures persistent
• Reporting points in halfspaces
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Voronoi Diagrams and Delaunay Triangulations
• Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
• Ray Shooting and Parametric Search
• Range searching on uncertain data
• Approximation algorithms for spreading points
• Space-time tradeoffs for approximate nearest neighbor searching
• On the convex layers of a planar set
• Nearest Neighbor Search
• Nearest-Neighbor Searching Under Uncertainty II
• Closest Pair and the Post Office Problem for Stochastic Points
• On Top-k Weighted<scp>Sum</scp>Aggregate Nearest and Farthest Neighbors in the L1 Plane
• Low-Dimensional Linear Programming with Violations
• Approximation algorithms for aligning points
• Preprocessing Imprecise Points and Splitting Triangulations

This page was built for publication: Nearest-neighbor searching under uncertainty. I