Non-equivalent partitions of \(d\)-triangles with Steiner points (Q598509): Difference between revisions

The authors study the number of possible partitions that may appear by bisecting a tetrahedron with Steiner points at the mid points of the edges [cf. \textit{A. Plaza} et al, in 5th Inter. Mesh Roundtable, Sandia Corporation, 123--136 (1996)]. This problem is of significant interest when a 3D tetrahedral triangulation is refined by bisection. The refined triangulation can always be found in constant time as 1-irregular tetrahedra can be handled using a hash table. Some bounds for this problem in general dimension \(d\) have also been obtained.