pith. sign in

arxiv: 0909.3706 · v3 · submitted 2009-09-21 · 🧮 math.MG · math.CO

Acute triangulations of polyhedra and R^n

classification 🧮 math.MG math.CO
keywords acutetriangulationtriangulationsproveanglesdihedralexistpolyhedra
0
0 comments X
read the original abstract

We study the problem of acute triangulations of convex polyhedra and the space R^n. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n-cube do not exist for n>=4. Further, we prove that acute triangulations of the space R^n do not exist for n>= 5. In the opposite direction, in R^3, we present a construction of an acute triangulation of the cube, the regular octahedron and a non-trivial acute triangulation of the regular tetrahedron. We also prove nonexistence of an acute triangulation of R^4 if all dihedral angles are bounded away from pi/2.

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.