Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


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

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

MPI-I-93-140. September 1993, 14 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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).
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-93-140.pdfMPI-I-93-140.pdf13850 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  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},