An improved algorithm for finding the closest pair of points

DOI10.1007/s11390-006-0027-7zbMath1190.68070OpenAlexW2083391401MaRDI QIDQ2508376

Hong Zhu, Haitao Wang, Qi Ge

Publication date: 12 October 2006

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11390-006-0027-7

zbMATH Keywords

complexitydivide and conquerclosest pair of pointsShamos and Hoey algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Verification of Closest Pair of Points Algorithms ⋮ An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case ⋮ Two-dimensional closest pair problem: a closer look

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved algorithm for finding the closest pair of points