This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
December 1983 (vol. 32 no. 12)
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.
Index Terms:
unimodal, Computation geometry, convex polygon, minimum distance, nonconvex polygon, planar polygon, polygon intersection
Citation:
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. 12, pp. 1203-1207, Dec. 1983, doi:10.1109/TC.1983.1676186
Usage of this product signifies your acceptance of the Terms of Use.