A dihedral acute triangulation of the cube

DOI10.1016/j.comgeo.2009.09.001zbMath1185.65040arXiv0905.3715MaRDI QIDQ2269829

Vadim Zharnitsky, Anil N. Hirani, Evan VanderZee, Damrong Guoy

Publication date: 11 March 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.3715

zbMATH Keywords

meshing; dihedral acute triangulation; three-dimensional cube

Mathematics Subject Classification ID

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

Related Items

Nonobtuse triangulations of PSLGs, The discrete maximum principle for Galerkin solutions of elliptic problems, Acute triangulations of polyhedra and \(\mathbb R^N\), Coxeter groups, hyperbolic cubes and acute triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dissection of the path-simplex in \(\mathbb {R}^n\) into \(n\) path-subsimplices
• The discrete maximum principle for linear simplicial finite element approximations of a reaction-diffusion problem
• Acute and nonobtuse triangulations of polyhedral surfaces
• Angular properties of Delaunay diagrams in any dimension
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• Tiling space and slabs with acute tetrahedra.
• There is no face-to-face partition of \(R^5\) into acute simplices
• Maximum principle and uniform convergence for the finite element method
• On Nonobtuse Simplicial Partitions