DocumentCode :
1147943
Title :
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
Author :
Chin, Francis ; Wang, Cao An
Author_Institution :
Department of Computer Science, Chinese University of Hong Kong
Issue :
12
fYear :
1983
Firstpage :
1203
Lastpage :
1207
Abstract :
Two planar geometric problems relating to a convex n-gon P and a simple nonconvex m-gon Q are considered.
Keywords :
Computation geometry; convex polygon; minimum distance; nonconvex polygon; planar polygon; polygon intersection; unimodal; Algorithm design and analysis; Arithmetic; Clocks; Computational modeling; Computer science; Councils; Euclidean distance; Geometry; Pattern recognition; Read-write memory; Computation geometry; convex polygon; minimum distance; nonconvex polygon; planar polygon; polygon intersection; unimodal;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1983.1676186
Filename :
1676186
Link To Document :
بازگشت