Please use this identifier to cite or link to this item:
Title: The eight-tetrahedra longest-edge partition and Kuhn triangulations
Authors: Plaza, Angel 
UNESCO Clasification: 120601 Construcción de algoritmos
Keywords: Eight-tetrahedra longest-edge partition
Kuhn triangulation
Right-type tetrahedron
Issue Date: 2007
Project: Mtm2005-08441-C02-02. Particiones Triangulares y Algoritmos de Refinamiento 
Journal: Computers and Mathematics with Applications 
Abstract: The Kuhn triangulation of a cube is obtained by subdividing the cube into six right-type tetrahedra once a couple of opposite vertices have been chosen. In this paper, we explicitly define the eight-tetrahedra longest-edge (8T-LE) partition of right-type tetrahedra and prove that for any regular right-type tetrahedron t, the iterative 8T-LE partition of t yields a sequence of tetrahedra similar to the former one. Furthermore, based on the Kuhn-type triangulations, the 8T-LE partition commutes with certain refinements based on the canonical boxel partition of a cube and its Kuhn triangulation.
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.01.023
Source: Computers and Mathematics with Applications [ISSN 0898-1221], v. 54 (3), p. 427-433
Appears in Collections:Artículos
Show full item record


checked on Dec 3, 2023

Page view(s)

checked on May 20, 2023

Google ScholarTM




Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.