Acute triangulations of polyhedra and R^N
From MaRDI portal
cubedihedral angle4-manifoldacute simplexDehn-Sommerville equationsflag-no-square triangulationoctahedronperiodic triangulationrich triangulationspecial subdivision
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) (n)-dimensional polytopes (52B11) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Polyhedra and polytopes; regular figures, division of spaces (51M20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- A Combinatorial Analogue of Poincaré's Duality Theorem
- A dihedral acute triangulation of the cube
- Acute and nonobtuse triangulations of polyhedral surfaces
- Acute triangulations of polygons
- Acute triangulations of polygons
- Applications of Klee's Dehn-Sommerville relations
- Average kissing numbers for non-congruent sphere packings
- Convex Polygons that Cannot Tile the Plane
- Faster Circle Packing with Application to Nonobtuse Triangulation
- Flag \(f\)-vectors and the \(cd\)-index
- Flag-no-square triangulations and Gromov boundaries in dimension 3.
- Hyperbolic Coxeter groups of large dimension.
- Lack of sphere packing of graphs via nonlinear potential theory
- Linear-size nonobtuse triangulation of polygons
- Nonobtuse triangulation of polygons
- On Nonobtuse Simplicial Partitions
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- Polynomials Associated with Finite Gell-Complexes
- Polytopes that fill \(\mathbb{R}^ n\) and scissors congruence
- Quasisymmetric parametrizations of two-dimensional metric spheres
- Tessellations
- There is no face-to-face partition of R^5 into acute simplices
- Tiling Three-Dimensional Space with Polyhedral Tiles of a Given Isomorphism Type
- Tiling space and slabs with acute tetrahedra.
- Triangulations. Structures for algorithms and applications
- Well-centered triangulation
Cited in
(21)- Collapsibility of CAT(0) spaces
- The minimum number of acute dihedral angles of a simplex
- Uniformly acute triangulations of polygons
- scientific article; zbMATH DE number 6346423 (Why is no real title available?)
- Existence of well-centered simplicial face-to-face tiling of five-dimensional space
- Simplices rarely contain their circumcenter in high dimensions.
- On primitive subdivisions of an elementary tetrahedron.
- Acute triangulations of polyhedra and the Euclidean space
- On a proper acute triangulation of a polyhedral surface
- Nonobtuse triangulations of PSLGs
- Five-dimensional Euclidean space cannot be conformly partitioned into acute simplices
- Coxeter groups, hyperbolic cubes and acute triangulations
- Tiling space and slabs with acute tetrahedra.
- Acute and nonobtuse triangulations of polyhedral surfaces
- A dihedral acute triangulation of the cube
- Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
- Acute Geodesic Triangulations of Manifolds
- On limits of graphs sphere packed in Euclidean space and applications
- Erratum to: There is no face-to-face partition of \(R ^{5}\) into acute simplices
- There is no face-to-face partition of R^5 into acute simplices
- Concrete polytopes may not tile the space
This page was built for publication: Acute triangulations of polyhedra and \(\mathbb R^N\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452820)
