de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Bericht

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

MPG-Autoren

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

http://pubman.mpdl.mpg.de/cone/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;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)

MPI-I-93-140.pdf
(beliebiger Volltext), 14MB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Dobrindt, K., Mehlhorn, K., & Yvinec, M.(1993). A complete and efficient algorithm for the intersection of a general convex polyhedron (MPI-I-93-140). Saarbrücken: Max-Planck-Institut für Informatik.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-B755-E
Zusammenfassung
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).