Tetragonal trapezohedron

Short description: Trapezohedron with eight faces

Tetragonal trapezohedron
Click on picture for large version.
Type	trapezohedra
Conway	dA4
Coxeter diagram
Faces	8 kites
Edges	16
Vertices	10
Face configuration	V4.3.3.3
Symmetry group	D_4d, [2⁺,8], (2*4), order 16
Rotation group	D₄, [2,4]⁺, (224), order 8
Dual polyhedron	Square antiprism
Properties	convex, face-transitive

In geometry, a tetragonal trapezohedron, or deltohedron, is the second in an infinite series of trapezohedra, which are dual to the antiprisms. It has eight faces, which are congruent kites, and is dual to the square antiprism.

In mesh generation

This shape has been used as a test case for hexahedral mesh generation,^[1]^[2]^[3]^[4]^[5] simplifying an earlier test case posited by mathematician Robert Schneiders in the form of a square pyramid with its boundary subdivided into 16 quadrilaterals. In this context the tetragonal trapezohedron has also been called the cubical octahedron,^[3] quadrilateral octahedron,^[4] or octagonal spindle,^[5] because it has eight quadrilateral faces and is uniquely defined as a combinatorial polyhedron by that property.^[3] Adding four cuboids to a mesh for the cubical octahedron would also give a mesh for Schneiders' pyramid.^[2] As a simply-connected polyhedron with an even number of quadrilateral faces, the cubical octahedron can be decomposed into topological cuboids with curved faces that meet face-to-face without subdividing the boundary quadrilaterals,^[1]^[5]^[6] and an explicit mesh of this type has been constructed.^[4] However, it is unclear whether a decomposition of this type can be obtained in which all the cuboids are convex polyhedra with flat faces.^[1]^[5]

In art

A tetragonal trapezohedron appears in the upper left as one of the polyhedral "stars" in M. C. Escher's 1948 wood engraving Stars.

Spherical tiling

The tetragonal trapezohedron also exists as a spherical tiling, with 2 vertices on the poles, and alternating vertices equally spaced above and below the equator.

Related polyhedra

The tetragonal trapezohedron is first in a series of dual snub polyhedra and tilings with face configuration V3.3.4.3.n.

References

↑ ^1.0 ^1.1 ^1.2 "Linear complexity hexahedral mesh generation", Proceedings of the Twelfth Annual Symposium on Computational Geometry (SCG '96), New York, NY, USA: ACM, 1996, pp. 58–67, doi:10.1145/237218.237237 .
↑ ^2.0 ^2.1 Mitchell, S. A. (1999), "The all-hex geode-template for conforming a diced tetrahedral mesh to any diced hexahedral mesh", Engineering with Computers 15 (3): 228–235, doi:10.1007/s003660050018 .
↑ ^3.0 ^3.1 ^3.2 Schwartz, Alexander (2004), "Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds", Experimental Mathematics 13 (4): 385–413, doi:10.1080/10586458.2004.10504548, http://projecteuclid.org/euclid.em/1109106431 .
↑ ^4.0 ^4.1 ^4.2 Carbonera, Carlos D.; Shepherd, Jason F.; Shepherd, Jason F. (2006), "A constructive approach to constrained hexahedral mesh generation", Proceedings of the 15th International Meshing Roundtable, Berlin: Springer, pp. 435–452, doi:10.1007/978-3-540-34958-7_25 .
↑ ^5.0 ^5.1 ^5.2 ^5.3 Erickson, Jeff (2013), "Efficiently hex-meshing things with topology", Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry (SoCG '13), New York, NY, USA: ACM, pp. 37–46, doi:10.1145/2462356.2462403, http://web.engr.illinois.edu/~jeffe/pubs/pdf/hexmesh.pdf .
↑ Mitchell, Scott A. (1996), "A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume", STACS 96: 13th Annual Symposium on Theoretical Aspects of Computer Science Grenoble, France, February 22–24, 1996, Proceedings, Lecture Notes in Computer Science, 1046, Berlin: Springer, pp. 465–476, doi:10.1007/3-540-60922-9_38, ISBN 978-3-540-60922-3, https://digital.library.unt.edu/ark:/67531/metadc626609/ .

External links

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Tetragonal trapezohedron. Read more

[e96-1] 1.0 ^1.1 ^1.2 "Linear complexity hexahedral mesh generation", Proceedings of the Twelfth Annual Symposium on Computational Geometry (SCG '96), New York, NY, USA: ACM, 1996, pp. 58–67, doi:10.1145/237218.237237 .

[m99-2] 2.0 ^2.1 Mitchell, S. A. (1999), "The all-hex geode-template for conforming a diced tetrahedral mesh to any diced hexahedral mesh", Engineering with Computers 15 (3): 228–235, doi:10.1007/s003660050018 .

[sz04-3] 3.0 ^3.1 ^3.2 Schwartz, Alexander (2004), "Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds", Experimental Mathematics 13 (4): 385–413, doi:10.1080/10586458.2004.10504548, http://projecteuclid.org/euclid.em/1109106431 .

[css06-4] 4.0 ^4.1 ^4.2 Carbonera, Carlos D.; Shepherd, Jason F.; Shepherd, Jason F. (2006), "A constructive approach to constrained hexahedral mesh generation", Proceedings of the 15th International Meshing Roundtable, Berlin: Springer, pp. 435–452, doi:10.1007/978-3-540-34958-7_25 .

[e13-5] 5.0 ^5.1 ^5.2 ^5.3 Erickson, Jeff (2013), "Efficiently hex-meshing things with topology", Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry (SoCG '13), New York, NY, USA: ACM, pp. 37–46, doi:10.1145/2462356.2462403, http://web.engr.illinois.edu/~jeffe/pubs/pdf/hexmesh.pdf .

[6] Mitchell, Scott A. (1996), "A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume", STACS 96: 13th Annual Symposium on Theoretical Aspects of Computer Science Grenoble, France, February 22–24, 1996, Proceedings, Lecture Notes in Computer Science, 1046, Berlin: Springer, pp. 465–476, doi:10.1007/3-540-60922-9_38, ISBN 978-3-540-60922-3, https://digital.library.unt.edu/ark:/67531/metadc626609/ .

[1]

[2]

[3]

[4]

[5]

[6]