Plane-sweep solves the closest pair problem elegantly
- 11 January 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (5) , 255-261
- https://doi.org/10.1016/0020-0190(88)90150-0
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- A note on Rabin's nearest-neighbor algorithmInformation Processing Letters, 1979