The all nearest-neighbor problem for convex polygons
- 1 June 1978
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 7 (4) , 189-192
- https://doi.org/10.1016/0020-0190(78)90066-2
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Divide-and-conquer in multidimensional spacePublished by Association for Computing Machinery (ACM) ,1976
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975