The 8T-LE partition applied to the obtuse triangulations of the 3D-cube
暂无分享,去创建一个
[1] Sergey Korotov,et al. Discrete maximum principles for finite element solutions of nonlinear elliptic problems with mixed boundary conditions , 2005, Numerische Mathematik.
[2] Dafna Talmor,et al. Generating a mixed mesh of hexahedra, pentahedra and tetrahedra from an underlying tetrahedral mesh , 2000 .
[3] Ángel Plaza. The eight-tetrahedra longest-edge partition and Kuhn triangulations , 2007, Comput. Math. Appl..
[4] J. D. Loera,et al. Triangulations: Structures for Algorithms and Applications , 2010 .
[5] G. Carey,et al. Local refinement of simplicial grids based on the skeleton , 2000 .
[6] Jeanne Pellerin,et al. Identifying combinations of tetrahedra into hexahedra: A vertex based strategy , 2017, Comput. Aided Des..
[7] Sergey Korotov,et al. Dissection of the path-simplex in R-n into n path-subsimplices , 2007 .
[8] J. Brandts,et al. Enumeration and investigation of acute 0/1-simplices modulo the action of the hyperoctahedral group , 2015, 1512.03044.
[9] Ángel Plaza,et al. Average adjacencies for tetrahedral skeleton-regular partitions , 2005 .
[10] Robert Schneiders,et al. Octree-Based Hexahedral Mesh Generation , 2000, Int. J. Comput. Geom. Appl..
[11] Sergey Korotov,et al. Local nonobtuse tetrahedral refinements around an edge , 2013, Appl. Math. Comput..
[12] M. Rivara. Algorithms for refining triangular grids suitable for adaptive and multigrid techniques , 1984 .
[13] J. P. Suárez,et al. A comparative study between some bisection based partitions in 3D , 2005 .
[14] Ángel Plaza,et al. The 8-tetrahedra longest-edge partition of right-type tetrahedra , 2004 .
[15] Miguel A. Padrón,et al. Non-degeneracy study of the 8-tetrahedra longest-edge partition , 2005 .