The eight-tetrahedra longest-edge partition and Kuhn triangulations (Q2460599): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2007.01.023 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037436576 / rank | |||
Normal rank |
Revision as of 00:35, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The eight-tetrahedra longest-edge partition and Kuhn triangulations |
scientific article |
Statements
The eight-tetrahedra longest-edge partition and Kuhn triangulations (English)
0 references
12 November 2007
0 references
An eight-tetrahedra longest-edge partition of a special type of tetrahedra called the regular right-type tetrahedra is defined. The regular right-type tetrahedron has four right isosceles triangles as faces. The eigth-tetrahedra longest-edge partition of a regular right-type tetrahedron is obtained by successive bisection of the initial tetrahedron. It is proven that the application of the iterative eight-tetrahedra longest-edge partition on any regular right-type tetrahedron generates a sequence of tetrahedra similar to the initial one. It is shown that based on the Kuhn triangulation, the eight-tetrahedra longest-edge partition computes certain refinements based on the canonical boxel partition of a cube.
0 references
subdivision
0 references
bisection
0 references
tetrahedron
0 references
right-type tetrahedron
0 references
eight-tetrahedra longest-edge partition
0 references
Kuhn triangulation
0 references