Abstract. 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. 1
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Abstract. Two algorithms for triangulating polyhedra, which give the number of tetrahedra depending ...
Considering the problem of the minimal triangulation for a given polyhedra (dividing polyhedra into...
AbstractWe describe the results of an enumeration of several classes of polyhedra. The enumerated cl...
We describe the results of an enumeration of several classes of polyhedra. The enumerated classes in...
We describe the results of an enumeration of several classes of polyhedra. The enumerated classes in...
The minimum triangulation of a convex polyhe-dron is a triangulation that contains the minimum numbe...
When solving an algorithmic problem involving a poly-hedron in R3, it is common to start by partitio...
Finding minimum triangulations of convex polyhedra is NPhard. The best approximation algorithms only...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Abstract. Two algorithms for triangulating polyhedra, which give the number of tetrahedra depending ...
Considering the problem of the minimal triangulation for a given polyhedra (dividing polyhedra into...
AbstractWe describe the results of an enumeration of several classes of polyhedra. The enumerated cl...
We describe the results of an enumeration of several classes of polyhedra. The enumerated classes in...
We describe the results of an enumeration of several classes of polyhedra. The enumerated classes in...
The minimum triangulation of a convex polyhe-dron is a triangulation that contains the minimum numbe...
When solving an algorithmic problem involving a poly-hedron in R3, it is common to start by partitio...
Finding minimum triangulations of convex polyhedra is NPhard. The best approximation algorithms only...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...