Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas. The Complexity of Cutting Convex Polytopes. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA. pages 66-76, ACM, 1987.
@inproceedings{ChazelleEG87,
title = {The Complexity of Cutting Convex Polytopes},
author = {Bernard Chazelle and Herbert Edelsbrunner and Leonidas J. Guibas},
year = {1987},
researchr = {https://researchr.org/publication/ChazelleEG87},
cites = {0},
citedby = {0},
pages = {66-76},
booktitle = {Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA},
publisher = {ACM},
}