Tilings and patterns
Nonobtuse triangulation of polygons
Discrete & Computational Geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
American Mathematical Monthly
Geometry and topology for mesh generation
Geometry and topology for mesh generation
Acute triangulations of polygons
European Journal of Combinatorics
Tiling space and slabs with acute tetrahedra
Computational Geometry: Theory and Applications
Acute Triangulations of Polygons
Discrete & Computational Geometry
Acute and nonobtuse triangulations of polyhedral surfaces
European Journal of Combinatorics
Applications of Klee’s Dehn–Sommerville Relations
Discrete & Computational Geometry - Special Issue Dedicated to the Memory of Victor Klee
On Nonobtuse Simplicial Partitions
SIAM Review
A dihedral acute triangulation of the cube
Computational Geometry: Theory and Applications
There Is No Face-to-Face Partition of R5 into Acute Simplices
Discrete & Computational Geometry
Triangulations: Structures for Algorithms and Applications
Triangulations: Structures for Algorithms and Applications
Hi-index | 0.00 |
We study the problem of acute triangulations of convex polyhedra and the space ℜ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 ℜn do not exist for n ≥ 5. In the opposite direction, in ℜ3 we construct nontrivial acute triangulations of all Platonic solids. We also prove nonexistence of an acute triangulation of ℜ4 if all dihedral angles are bounded away from ϒ/2.