Triangulations of some cases of polyhedra with a small number of tetrahedra
Milica Stojanović
Abstract
Open-access reader
Milica Stojanović
Abstract
Open-access reader
Considering the hypothesis that there exists a polyhedron with a minimal triangulation by 2n - 10 tetrahedra, earlier results show that such polyhedra can have only vertices of order 5, 6 or separated vertices of order 4. Other polyhedra have minimal triangulation with a smaller number of tetrahedra. This paper presents the examples of polyhedra with the mentioned property and with the triangulation by 2n - 11 tetrahedra. .
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Considering the hypothesis that there exists a polyhedron with a minimal triangulation by 2n - 10 tetrahedra, earlier results show that such polyhedra can have only vertices of order 5, 6 or separated vertices of order 4. Other polyhedra have minimal triangulation with a smaller number of tetrahedra. This paper presents the examples of polyhedra with the mentioned property and with the triangulation by 2n - 11 tetrahedra. .
Key concepts: Polyhedron, Tetrahedron, Triangulation, Combinatorics, Mathematics, Geometry