Convex Polyhedra With Triangular Faces and Cone Triangulation
Yugoslav journal of operations research, Tome 21 (2011) no. 1, p. 79
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Considering the problem of the minimal triangulation for a given polyhedra
(dividing polyhedra into tetrahedra) it is known that the cone triangulation provides the
number of tetrahedra which is the smallest, or the closest to it. It is also shown that when
we want to know whether the cone triangulation is the minimal one, it is necessary to
find the order of all vertices, as well as the order of “separating circles”. Here, we will
give algorithms for testing the necessary condition for the cone triangulation if it is the
minimal one. The algorithm for forming the cone triangulation will also be given.
Classification :
52C17, 68R10, 52B05, 05C85, 68P05, 68Q65
Keywords: Triangulation of polyhedra, minimal triangulation, graph algorithms, abstract data type of graph.
Keywords: Triangulation of polyhedra, minimal triangulation, graph algorithms, abstract data type of graph.
@article{YJOR_2011_21_1_a5,
author = {Milica Stojanovi\'c and Milica Vu\v{c}kovi\'c},
title = {Convex {Polyhedra} {With} {Triangular} {Faces} and {Cone} {Triangulation}},
journal = {Yugoslav journal of operations research},
pages = {79 },
year = {2011},
volume = {21},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2011_21_1_a5/}
}
Milica Stojanović; Milica Vučković. Convex Polyhedra With Triangular Faces and Cone Triangulation. Yugoslav journal of operations research, Tome 21 (2011) no. 1, p. 79 . http://geodesic.mathdoc.fr/item/YJOR_2011_21_1_a5/