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

Dobrindt, Katrin; Mehlhorn, Kurt; Yvinec, Mariette; Dehne, Frank K. H. A.; Sack, Jörg-Rüdiger; Santoro, Nicola; Whitesides, Sue

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

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;

/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;

/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;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

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: https://hdl.handle.net/11858/00-001M-0000-0014-ADC0-B

Abstract

There is no abstract available