A Simple Yet Fast Algorithm for the Closest-Pair Problem Using Sorted Projections on Multi-Dimensions

Mehmet Emin DalkiliƧ, Serkan Ergun. A Simple Yet Fast Algorithm for the Closest-Pair Problem Using Sorted Projections on Multi-Dimensions. In Erol Gelenbe, Ricardo Lent, editors, Information Sciences and Systems 2013 - Proceedings of the 28th International Symposium on Computer and Information Sciences, ISCIS 2013, Paris, France, October 28-29, 2013. Volume 264 of Lecture Notes in Electrical Engineering, pages 23-34, Springer, 2013. [doi]

Abstract

Abstract is missing.