A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions
Chazelle [FOCS'89] gave a linear-time algorithm to compute the intersection of two convex polyhedra in three dimensions. We present a simpler algorithm to do the same.
convex polyhedra
intersection
Dobkin–Kirkpatrick hierarchy
733-738
Regular Paper
Timothy M.
Chan
Timothy M. Chan
10.4230/LIPIcs.SOCG.2015.733
Nancy M. Amato, Michael T. Goodrich, and Edgar A. Ramos. A randomized algorithm for triangulating a simple polygon in linear time. Discrete and Computational Geometry, 26(2):245-265, 2001.
Timothy M. Chan. Deterministic algorithms for 2-d convex programming and 3-d online linear programming. Journal of Algorithms, 27(1):147-166, 1998.
Bernard Chazelle. Triangulating a simple polygon in linear time. Discrete and Computational Geometry, 6:485-524, 1991.
Bernard Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM Journal on Computing, 21(4):671-696, 1992.
Kenneth L. Clarkson and Peter W. Shor. Application of random sampling in computational geometry, II. Discrete and Computational Geometry, 4:387-421, 1989.
David P. Dobkin and David G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. Journal of Algorithms, 6(3):381-392, 1985.
David P. Dobkin and David G. Kirkpatrick. Determining the separation of preprocessed polyhedra - A unified approach. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming, pages 400-413, 1990.
Martin E. Dyer, Nimrod Megiddo, and Emo Welzl. Linear programming. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 45. CRC Press, second edition, 2004.
David G. Kirkpatrick. Efficient computation of continuous skeletons. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 18-27, 1979.
David G. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12(1):28-35, 1983.
Andrew K. Martin. A simple primal algorithm for intersecting 3-polyhedra in linear time. Master’s thesis, Department of Computer Science, University of British Columbia, 1991. https://circle.ubc.ca/handle/2429/30114 or http://www.cs.ubc.ca/cgi-bin/tr/1991/TR-91-16.
Ketan Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.
Franco P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM, 20(2):87-93, 1977.
Michael Ian Shamos and Dan Hoey. Closest-point problems. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pages 151-162, 1975.
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode