论文信息 - A Note on the all Nearest-Neighbor Problem for Convex Polygons - 字舞流文

A Note on the all Nearest-Neighbor Problem for Convex Polygons

D. T. Lee | C. C. Yang | D. T. Lee | C. C. Yang

[1] Selim G. Akl,et al. A Fast Convex Hull Algorithm , 1978, Inf. Process. Lett..

[2] D. T. Lee,et al. The All Nearest-Neighbor Problem for Convex Polygons , 1978, Inf. Process. Lett..

[3] Herbert Freeman,et al. Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.