External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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.

Abstract

Abstract is missing.

runs on