Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec. A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides, editors, Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings. Volume 709 of Lecture Notes in Computer Science, pages 314-324, Springer, 1993.
@inproceedings{DobrindtMY93,
title = {A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron},
author = {Katrin Dobrindt and Kurt Mehlhorn and Mariette Yvinec},
year = {1993},
tags = {completeness},
researchr = {https://researchr.org/publication/DobrindtMY93},
cites = {0},
citedby = {0},
pages = {314-324},
booktitle = {Algorithms and Data Structures, Third Workshop, WADS 93, Montréal, Canada, August 11-13, 1993, Proceedings},
editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Nicola Santoro and Sue Whitesides},
volume = {709},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-57155-8},
}