A note on the all nearest-neighbor problem for convex polygons
Authors:
- C.C. YangCYC.C. Yang
- D.T. LeeDLD.T. Lee
- 30 April 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 8 (4) , 193-194
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- A fast convex hull algorithmInformation Processing Letters, 1978
- The all nearest-neighbor problem for convex polygonsInformation Processing Letters, 1978
- Determining the minimum-area encasing rectangle for an arbitrary closed curveCommunications of the ACM, 1975