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.
No references recorded for this publication.
No citations of this publication recorded.