Comparison of various trees for nearest-point search with/without the Voronoi diagram.

DOI10.1016/S0020-0190(02)00221-1zbMath1042.68681OpenAlexW2005209891MaRDI QIDQ1853098

Takeshi Kanda, Kōkichi Sugihara

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00221-1

zbMATH Keywords

Computational geometryVoronoi diagramPoint locationTreeNearest-point search

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Analysis of range searches in quad trees
• Quad trees: A data structure for retrieval by composite keys
• Multidimensional binary search trees used for associative searching
• An Algorithm for Finding Nearest Neighbors
• Location of a Point in a Planar Subdivision and Its Applications

This page was built for publication: Comparison of various trees for nearest-point search with/without the Voronoi diagram.