The Community for Technology Leaders
Green Image
Issue No. 12 - December (1983 vol. 32)
ISSN: 0018-9340
pp: 1203-1207
F. Chin , Department of Computer Science, Chinese University of Hong Kong
Two planar geometric problems relating to a convex n-gon P and a simple nonconvex m-gon Q are considered.
unimodal, Computation geometry, convex polygon, minimum distance, nonconvex polygon, planar polygon, polygon intersection
F. Chin, null Cao An Wang, "Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons", IEEE Transactions on Computers, vol. 32, no. , pp. 1203-1207, December 1983, doi:10.1109/TC.1983.1676186
90 ms
(Ver 3.3 (11022016))