The Complexity of Cutting Convex Polytopes

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.

Authors

Bernard Chazelle

This author has not been identified. Look up 'Bernard Chazelle' in Google

Herbert Edelsbrunner

This author has not been identified. Look up 'Herbert Edelsbrunner' in Google

Leonidas J. Guibas

This author has not been identified. Look up 'Leonidas J. Guibas' in Google