de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors

Dobrindt,  Katrin
Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

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

Yvinec,  Mariette
Max Planck Society;

Dehne,  Frank K. H. A.
Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45331

Sack,  Jörg-Rüdiger
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Santoro,  Nicola
Max Planck Society;

Whitesides,  Sue
Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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. In Algorithms and data structures (WADS-93): 3rd workshop (pp. 314-324). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-ADC0-B
Abstract
There is no abstract available