Algorithms for investigating optimality of cone triangulation for a polyhedron
Kragujevac Journal of Mathematics, Tome 30 (2007) no. 1
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The problem of finding minimal triangulation of a given polyhedra (dividing polyhedra into tetrahedra) is very actual now. It is known that cone triangulation for a polyhedron provides the smallest number of tetrahedra, or close to it. In earlier investigations when this triangulation was the optimal one, it was shown that conditions for vertices to be of the order five, six or for separated vertices of order four was only the necessary ones. It was shown that then if it exists the "separating circle" of order less then six, for two vertices of order six, cone triangulation is not the minimal one. \\ Here, test algorithms will be given, for the case when the given polyhedron has separating circle of order five or less.
@article{KJM_2007_30_1_a24,
author = {Milica Stojanovi\'c and Milica Vu\v{c}kovi\'c},
title = {Algorithms for investigating optimality of cone triangulation for a polyhedron},
journal = {Kragujevac Journal of Mathematics},
pages = {327 - 342},
year = {2007},
volume = {30},
number = {1},
url = {http://geodesic.mathdoc.fr/item/KJM_2007_30_1_a24/}
}
TY - JOUR AU - Milica Stojanović AU - Milica Vučković TI - Algorithms for investigating optimality of cone triangulation for a polyhedron JO - Kragujevac Journal of Mathematics PY - 2007 SP - 327 EP - 342 VL - 30 IS - 1 UR - http://geodesic.mathdoc.fr/item/KJM_2007_30_1_a24/ ID - KJM_2007_30_1_a24 ER -
Milica Stojanović; Milica Vučković. Algorithms for investigating optimality of cone triangulation for a polyhedron. Kragujevac Journal of Mathematics, Tome 30 (2007) no. 1. http://geodesic.mathdoc.fr/item/KJM_2007_30_1_a24/