Computational Geometry Column 40

Simple item page
dc.creatorO'Rourke, Joseph
dc.date2000-10-31
dc.date.accessioned2026-07-07T03:16:40Z
dc.date.available2026-07-07T03:16:40Z
dc.descriptionIt 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.
dc.description3 pages; 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0010039
dc.identifierhttp://arxiv.org/abs/cs/0010039
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30440
dc.subjectComputational Geometry
dc.subjectF.2.2; G.2.1
dc.titleComputational Geometry Column 40
dc.typetext

Files

Collections

arXiv