Computational Geometry Column 40

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.
3 pages; 4 figures

Keywords

Computational Geometry, F.2.2; G.2.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30440

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0010039
 http://arxiv.org/abs/cs/0010039

Collections

arXiv