Summary
Plane-sweep algorithms form a fairly general approach to two-dimensional problems of computational geometry. No corresponding general space-sweep algorithms for geometric problems in 3- space are known. We derive concepts for such space-sweep algorithms that yield an efficient solution to the problem of solving any set operation (union, intersection, ...) of two convex polyhedra. Our solution matches the best known time bound of O(n log n), where n is the combined number of vertices of the two polyhedra.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abo, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley 1974
Bieri, H., Nef, W.: A Recursive Sweep-Plane Algorithm, Determining All Cells of a Finite Division of ℝd. Computing 28, 189–198 (1982)
Bieri, H., Nef, W.: A Sweep-Plane Algorithm for Computing the Volume of Polyhedra Represented in Boolean Form. Linear Algebra and Appl. 52/53, 69–79 (1983)
Dobkin, D.P., Kirkpatrick, D.G.: Fast Detection of Polyhedral Intersections. Proc. 9th ICALP, Springer LNCS 140, 154–165 (1982)
Dobkin, D.R., Kirkpatrick, D.G.: A Linear Algorithm for Determining the Separation of Convex Polyhedra. Manuscript, 1983
Hadwiger, H.: Eulers Charakteristik und kombinatorische Geometrie. J. Reine Angew. Math. 194, 101–110(1955)
Hadwiger, H.: Eine Schnittrekursion für die Eulersche Charakteristik euklidischer Polyeder mit Anwendungen innerhalb der kombinatorischen Geometrie. Elem. Math. 23, 121–132 (1968)
Hertel, S.: Sweep-Algorithmen für Polygone und Polyeder. Univ. des Saarlandes, Saarbrücken, Diss. 1984
Muller, D.E., Preparata, F.P.: Finding the Intersection of Two Convex Polyhedra. Theor. Comput. Sci. 7, 217–236 (1978)
Mairson, H., Stolfi, J.: Personal communication, 1983
Nievergelt, J., Preparata, F.P.: Plane-Sweep Algorithms for Intersecting Geometric Figures. Comm. ACM 25, 739–747 (1982)
Schmitt, A.: Time and Space Bounds for Hidden Line and Hidden Surface Algorithms. Proc. EUROGRAPHICS, pp. 43–56, 1981. Amsterdam: North-Holland, 1981
Shamos, M.I.: Geometric Complexity. Proc. 7th ACM STOC pp. 224–233, 1975
Shamos, M.I., Hoey, D.: Geometric Intersection Problems. Proc. 17th IEEE FOCS Symp. pp. 208–215, 1976
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hertel, S., Mäntylä, M., Mehlhorn, K. et al. Space sweep solves intersection of convex polyhedra. Acta Informatica 21, 501–519 (1984). https://doi.org/10.1007/BF00271644
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00271644