Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions

DOI10.1016/j.jcss.2006.01.007zbMath1100.68632OpenAlexW2039289489MaRDI QIDQ2507694

Nishant Sharma, Yogish Sabharwal, Sandeep Sen

Publication date: 5 October 2006

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2006.01.007

zbMATH Keywords

data structuresVoronoi diagramsapproximate nearest neighbor

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items

A new digital watermarking scheme for 3D triangular mesh models ⋮ WCOID-DG: an approach for case base maintenance based on weighting, clustering, outliers, internal detection and DBsan-Gmeans ⋮ Approximate Polytope Membership Queries

Cites Work

• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Space-efficient approximate Voronoi diagrams
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Nice point sets can have nasty Delaunay triangulations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item