An optimal algorithm for intersecting three-dimensional convex polyhedra

This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given.

[1]  C. Rourke,et al.  Introduction to Piecewise-Linear Topology , 1972 .

[2]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1975, AFIPS '75.

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

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

[5]  Michael Ian Shamos,et al.  Divide and Conquer for Linear Expected Time , 1978, Information Processing Letters.

[6]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7]  David P. Dobkin,et al.  Efficient uses of the past , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[8]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[9]  Joseph O'Rourke,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[10]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

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

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

[13]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[14]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[15]  Kurt Mehlhorn,et al.  Intersecting two polyhedra one of which is convex , 1985, FCT.

[16]  Herbert Edelsbrunner,et al.  Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane , 1985, Inf. Process. Lett..

[17]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[18]  Raimund Seidel,et al.  Voronoi diagrams and arrangements , 1986, Discret. Comput. Geom..

[19]  Bernard Chazelle,et al.  Intersection of convex objects in two and three dimensions , 1987, JACM.

[20]  David P. Dobkin,et al.  Primitives for the manipulation of three-dimensional subdivisions , 1987, SCG '87.

[21]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[22]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[23]  Chee-Keng Yap,et al.  A geometric consistency theorem for a symbolic perturbation scheme , 1988, SCG '88.

[24]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[25]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[26]  Micha Sharir,et al.  Triangles in space or building (and analyzing) castles in the air , 1990, Comb..