English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron

MPS-Authors

Dobrindt,  K.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Yvinec,  M.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-93-140.pdf
(Any fulltext), 14MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Dobrindt, K., Mehlhorn, K., & Yvinec, M.(1993). A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron (MPI-I-93-140). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B755-E
Abstract
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).