Intersecting two polyhedra one of which is convex

  • Kurt Mehlhorn
  • Klaus Simon
Late Arrivals
Part of the Lecture Notes in Computer Science book series (LNCS, volume 199)


Let P and Q be polyhedra one of which is convex. Let n and m be the number of edges of P and Q respectively and let s be the number of edges of the intersection PQ. We show how to compute PQ in time O((n + m + s) log(n + m + s)). Previously only algorithms with running time O(nm) were known.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [1]
    H. Edelsbrunner, H.A. Maurer: “Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane”, Information Processing Letters, to appear.Google Scholar
  2. [2]
    St. Hertel, M. Mäntylä, K. Mehlhorn, J. Nievergelt: “Space Sweep Solves Intersection of Two Convex Polyhedra Elegantly”, Acta Informatica, 21, 501–519, 1984.Google Scholar
  3. [3]
    St. Hertel, K. Mehlhorn: “Fast Triangulation of Simple Polygons”, FCT 83, LNCS Vol 158, 207–218.Google Scholar
  4. [4]
    D.P. Dobkin, D.G. Kirkpatrick: “Fast Detection of Polyhedral Intersections”, 9th ICALP, LNCS 140, 154–165, 1982.Google Scholar
  5. [5]
    D. Kirkpatrick: “Optimal Search in Planar Subdivisions”, SICOMP 12, 28–35, 1983.Google Scholar
  6. [6]
    K. Mehlhorn: “Data Structures and Efficient Algorithms”, Vol 3: “Multi-dimensional Data Structures and Computational Geometry”, Springer Verlag, EATCS Monographs in Computer Science, 1984.Google Scholar
  7. [7]
    D.E. Muller, F.P. Preparata: “Finding the Intersection of Two Convex Polyhedra”, TCS 7, 217–236, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Kurt Mehlhorn
    • 1
  • Klaus Simon
    • 1
  1. 1.Universität des SaarlandesSaarbrückenWest Germany

Personalised recommendations