MPI-INF Logo
MPI-INF/SWS Research Reports 1991-2021

2. Number - All Departments

MPI-I-93-140

A complete and efficient algorithm for the intersection of a general convex polyhedron

Dobrindt, K. and Mehlhorn, Kurt and Yvinec, M.

September 1993, 14 pages.

.
Status: available - back from printing

A polyhedron is any set that can be obtained from the open half\-spaces by a finite number of set complement and set intersection operations. We give an efficient and complete algorithm for intersecting two three--dimensional polyhedra, one of which is convex. The algorithm is efficient in the sense that its running time is bounded by the size of the inputs plus the size of the output times a logarithmic factor. The algorithm is complete in the sense that it can handle all inputs and requires no general position assumption. We also describe a novel data structure that can represent all three--dimensional polyhedra (the set of polyhedra representable by all previous data structures is not closed under the basic boolean operations).

URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1993-140

Hide details for BibTeXBibTeX
@TECHREPORT{DobrindtMehlhornYvinec93,
  AUTHOR = {Dobrindt, K. and Mehlhorn, Kurt and Yvinec, M.},
  TITLE = {A complete and efficient algorithm for the intersection of a general convex polyhedron},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-93-140},
  MONTH = {September},
  YEAR = {1993},
  ISSN = {0946-011X},
}