Minimal 3-triangulations of p-toroid
classification
🧮 math.MG
keywords
convexpolyhedraalwaysminimaltetrahedratoroidtriangulationsconcepts
read the original abstract
It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is interesting to investigate possibilities and properties of their 3-triangulations. Here, we study the minimal necessary number of tetrahedra for the triangulation of a 3-triangulable $p$-toroid. For that purpose, we developed the concepts of piecewise convex polyhedra and graphs of connection.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.