Skip to main content
Log in

A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

Chazelle [SIAM J Comput 21(4):671–696, 1992] 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. Throughout the paper, “below” means “below or is incident to” unless preceded by “strictly”.

References

  1. Amato, N.M., Goodrich, M.T., Ramos, E.A.: A randomized algorithm for triangulating a simple polygon in linear time. Discrete Comput. Geom. 26(2), 245–265 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chan, T.M.: Deterministic algorithms for 2-D convex programming and 3-D online linear programming. J. Algorithms 27(1), 147–166 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6, 485–524 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chazelle, B.: An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM J. Comput. 21(4), 671–696 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Clarkson, K.L., Shor, P.W.: Application of random sampling in computational geometry. II. Discrete Comput. Geom. 4, 387–421 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dobkin, D.P., Kirkpatrick, D.G.: A linear algorithm for determining the separation of convex polyhedra. J. Algorithms 6(3), 381–392 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dobkin, D.P., Kirkpatrick, D.G.: Determining the separation of preprocessed polyhedra—A unified approach. In: Proceedings of the 17th International Colloquium on Automata, Languages and Programming, pp. 400–413 (1990)

  8. Dyer, M., Megiddo, N., Welzl, E.: Linear programming. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, Chapter 45, 2nd edn. CRC Press, New York (2004)

    Google Scholar 

  9. Kirkpatrick, D.G.: Efficient computation of continuous skeletons. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pp. 18–27 (1979)

  10. Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28–35 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  11. Martin, A.K.: A simple primal algorithm for intersecting 3-polyhedra in linear time. Master’s thesis, Department of Computer Science, University of British Columbia. https://circle.ubc.ca/handle/2429/30114 or http://www.cs.ubc.ca/cgi-bin/tr/1991/TR-91-16 (1991)

  12. Mulmuley, K.: Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  13. Preparata, F.P., Hong, S.J.: Convex hulls of finite sets of points in two and three dimensions. Commun. ACM 20(2), 87–93 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  14. Shamos M.I., Hoey D.: Closest-point problems. In: Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pp. 151–162 (1975)

Download references

Acknowledgments

The author thanks Stefan Langerman for discussion on these problems.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Timothy M. Chan.

Additional information

Editor in Charge: János Pach

A preliminary version of this work appeared in the Proceedings of the 31st International Symposium on Computational Geometry, 2015. Part of this work was done during the author’s visit to the Hong Kong University of Science and Technology.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chan, T.M. A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. Discrete Comput Geom 56, 860–865 (2016). https://doi.org/10.1007/s00454-016-9785-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-016-9785-3

Keywords

Navigation