DCG
2000
13 years 11 months ago
2000
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...
DCG
2000
13 years 11 months ago
2000
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P.
JAL
2006
13 years 11 months ago
2006
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...
DM
2006
13 years 11 months ago
2006
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...