Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons

Two planar geometric problems relating to a convex n-gon P and a simple nonconvex m-gon Q are considered.

[1]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

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

[3]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[4]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[5]  D. T. Lee,et al.  An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.

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

[7]  Godfried T. Toussaint,et al.  An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[8]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[9]  Jacob T. Schwartz,et al.  Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.