Sciweavers

DCG
2000
94views more  DCG 2000»
13 years 10 months ago
Finding Small Triangulations of Polytope Boundaries Is Hard
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...
Jürgen Richter-Gebert
DCG
2000
55views more  DCG 2000»
13 years 10 months ago
Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P.
Alexander Below, Jesús A. De Loera, Jü...
JAL
2006
114views more  JAL 2006»
13 years 10 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
DM
2006
76views more  DM 2006»
13 years 10 months ago
Lex M versus MCS-M
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
Yngve Villanger