An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case
Journal of Computer Science and Technology - United States
doi 10.1007/s11390-012-1272-6
Full Text
Open PDFAbstract
Available in full text
Categories
Date
July 1, 2012
Authors
Publisher
Springer Science and Business Media LLC