Abstract

Abstract. 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. Key words, computational geometry, convex polyhedra AMS(MOS) subject classifications. 68Q25, 68H05 1. Introduction. Giventwo

Citations

643	Algorithms in combinatorial geometry - Edelsbrunner - 1987
182	Linear-Time Algorithms for Linear Programming in R3 and Related Problems - Megiddo - 1983
154	Introduction to piecewise-linear topology - Rourke, Sanderson - 1972
124	Data Structures and Algorithms 3: Multi-dimensional Searching and - Mehlhorn - 1984
74	Primitives for the manipulation of three-dimensional subdivisions. Algorithmica 4 - Dobkin, Laszlo - 1989
63	A geometric consistency theorem for a symbolic perturbation scheme - Yap
58	Finding the intersection of two convex polyhedra, Theoret - Muller, Preparata - 1978
40	A linear time algorithm for computing the Voronoi diagram of a convex polygon. Discrete and Computational Geometry 4 - Aggarwal, Guibas, et al. - 1989
34	NADDOR D.: A new linear algorithm for intersecting convex polygons - O’ROURKE, CHIEN, et al. - 1982
19	Efficient use of the past - Dobkin, Munro - 1980
11	Triangles in space or building (and analyzing) castles in the air - Aronov, Sharir - 1990
11	Intersecting two polyhedra one of which is convex - Mehlhourn, Simon - 1986
10	Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane - Edelsbrunner, Maurer - 1984
7	Space Sweep Solves Intersection of Convex Polyhedra - Hertel, Mantyla, et al. - 1984
5	Voronoi diagrams and arrangements, Discrete Comput - Edelsbrunner, Seidel - 1986
2	Intersection ofconvex objects in two and three dimensions - CHAZELLE, DOBKIN - 1987
1	BAUMGART,A polyhedron representationfor computer vision - G - 1975
1	Divide and conquerfor linear expected time - SHAMOS - 1978
1	Fast detection ofpolyhedral intersection, Theoret - DOBKIN, KIRKPATRICK - 1983
1	Linear time algorithmsfor two and three-variable linear programs - DYER - 1984
1	Simulation ofsimplicity: a technique to cope with degenerate cases in geometric algorithms - EDELSBRUNNER, MCKE - 1988
1	Convex hulls offinite sets ofpoints in two and three dimensions - PREPARATA, HONG - 1977
1	Geometric intersectionproblems - SHAMOS, HOEY - 1976