论文信息 - A simple linear algorithm for intersecting convex polygons

A simple linear algorithm for intersecting convex polygons

LetP andQ be two convex polygons withm andn vertices, respectively, which are specified by their cartesian coordinates in order. A simpleO(m+n) algorithm is presented for computing the intersection ofP andQ. Unlike previous algorithms, the new algorithm consists of a two-step combination of two simple algorithms for finding convex hulls and triangulations of polygons.

Godfried T. Toussaint | G. Toussaint

[1] Godfried T. Toussaint,et al. An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons , 1983, Computing.

[2] Michael Ian Shamos,et al. Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[3] G. Toussaint. Solving geometric problems with the rotating calipers , 1983 .

[4] JOSEPH O’ROURKE,et al. A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[5] Gary H. Meisters,et al. POLYGONS HAVE EARS , 1975 .

[6] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[7] Bernard Chazelle,et al. Detection is easier than computation (Extended Abstract) , 1980, STOC '80.

[8] B. Chazelle. Computational geometry and convexity , 1980 .

[9] Leonidas J. Guibas,et al. A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10] Godfried T. Toussaint,et al. On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..

[11] Godfried T. Toussaint,et al. Computational Geometric Problems in Pattern Recognition , 1982 .