An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case
From MaRDI portal
Publication:2637298
DOI10.1007/s11390-012-1272-6zbMath1280.68282arXiv1010.5908OpenAlexW1669955554MaRDI QIDQ2637298
José C. Pereira, Fernando G. Lobo
Publication date: 11 February 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5908
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Verification of Closest Pair of Points Algorithms, Two-dimensional closest pair problem: a closer look
Cites Work