A dihedral acute triangulation of the cube

Authors:
Evan VanderZee;Anil N. Hirani;Vadim Zharnitsky;Damrong Guoy
Affiliations:
Department of Mathematics, University of Illinois at Urbana-Champaign, United States;Department of Computer Science, University of Illinois at Urbana-Champaign, United States;Department of Mathematics, University of Illinois at Urbana-Champaign, United States;Synopsys Inc., United States
Venue:
Computational Geometry: Theory and Applications
Year:
2010

Citing 5
Cited 3

Dihedral bounds for mesh generation in high dimensions

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Tiling space and slabs with acute tetrahedra

Computational Geometry: Theory and Applications
There Is No Face-to-Face Partition of R5 into Acute Simplices

Discrete & Computational Geometry
Acute and nonobtuse triangulations of polyhedral surfaces

European Journal of Combinatorics
On Nonobtuse Simplicial Partitions

SIAM Review

Acute triangulations of polyhedra and the Euclidean space

Proceedings of the twenty-sixth annual symposium on Computational geometry
Well-Centered Triangulation

SIAM Journal on Scientific Computing
There are only two nonobtuse binary triangulations of the unit n-cube

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The method of constructing the acute triangulation is described, and symmetries of the triangulation are discussed.