Convex polyhedra with triangular faces and cone triangulation | Zendy

Milica Stojanović | Zendy; Milica Vučković | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Convex polyhedra with triangular faces and cone triangulation

Author(s) -

Milica Stojanović,

Milica Vučković

Publication year - 2011

Publication title -

yugoslav journal of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.221

H-Index - 21

eISSN - 1820-743X

pISSN - 0354-0243

DOI - 10.2298/yjor1101079s

Subject(s) - polyhedron , triangulation , minimum weight triangulation , tetrahedron , cone (formal languages) , pitteway triangulation , combinatorics , regular polygon , mathematics , point set triangulation , delaunay triangulation , constrained delaunay triangulation , algorithm , geometry

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research