Forked from
gmsh / gmsh
Source project has a limited visibility.
-
Christophe Geuzaine authored
use serendipity tetrahedron and haxahedron to compute high order interior vertices (instead of "unusual"... and now inexistant face-saturated incomplete element) clean up high order routines by refactoring high-order tet/hex/prism/pyram generation code
Christophe Geuzaine authoreduse serendipity tetrahedron and haxahedron to compute high order interior vertices (instead of "unusual"... and now inexistant face-saturated incomplete element) clean up high order routines by refactoring high-order tet/hex/prism/pyram generation code