Conic nearest neighbor queries and approximate Voronoi diagrams

DOI10.1016/j.comgeo.2014.08.002zbMath1315.65017OpenAlexW2130427406MaRDI QIDQ2261577

Theocharis Malamatos, Stefan Funke, Nicola Wolpert, Domagoj Matijević

Publication date: 6 March 2015

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.08.002

zbMATH Keywords

algorithmVoronoi diagramnearest neighbourproximity problemstop-down method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point location in arrangements of hyperplanes
• Indexing moving points
• Data structures for halfplane proximity queries and incremental Voronoi diagrams
• Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
• Foundations of multidimensional and metric data structures.
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Geometric Spanner Networks
• Space-time tradeoffs for approximate nearest neighbor searching
• A Randomized Algorithm for Closest-Point Queries
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Shape dimension and intrinsic metric from samples of manifolds with high co-dimension
• A dynamic data structure for approximate range searching
• Approximate polytope membership queries
• Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

This page was built for publication: Conic nearest neighbor queries and approximate Voronoi diagrams