Document Type

Article

Publication Date

12-2000

Publication Title

International Journal of Computational Geometry & Applications

Abstract

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.

Volume

10

Issue

6

First Page

649

Last Page

651

DOI

dx.doi.org/10.1142/S021819590000036X

ISSN

1793-6357

Comments

Language included at the request of the publisher: Electronic version of an article published as International Journal of Computational Geometry & Applications, 10, 6, 2000, 649-651, dx.doi.org/10.1142/S021819590000036X © copyright World Scientific Publishing Company http://www.worldscientific.com/worldscinet/ijcga

Share

COinS