A Linear Algorithm for Determining the Separation of Convex Polyhedra

[1]  Francis Y. L. Chin,et al.  Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.

[2]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[3]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[4]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

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

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

[7]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

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

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

[10]  Frank Harary,et al.  Graph Theory , 2016 .