On numerical regularity of trisection-based algorithms in 3D

DOI10.1007/978-3-319-32857-7_35MaRDI QIDQ2954441zbMATH OpenOpenAlexFDO

Authors Sergey Korotov, Ángel Plaza, José P. Suárez, Pilar Abad

Publication date 13 January 2017

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-32857-7_35

zbMATH Keywords

algorithmlongest-edge trisectionmesh adaptivitymesh regularitynumerical examplestetrahedral mesh

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• On the non-degeneracy property of the longest-edge trisection of triangles
• Local refinement based on the 7-triangle longest-edge partition
• scientific article; zbMATH DE number 1163631
• New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
• A comparative study between some bisection based partitions in 3D

Cites work

• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• A 3D refinement/derefinement algorithm for solving evolution problems
• A comparative study between some bisection based partitions in 3D
• A recursive approach to local mesh refinement in two and three dimensions
• An analysis of simplex shape measures for anisotropic meshes
• Computational aspects of the refinement of 3D tetrahedral meshes
• scientific article; zbMATH DE number 989538 (Why is no real title available?)
• scientific article; zbMATH DE number 1255561 (Why is no real title available?)
• scientific article; zbMATH DE number 849031 (Why is no real title available?)
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• Local mesh refinement in 2 and 3 dimensions
• Local refinement of simplicial grids based on the skeleton
• Locally Adapted Tetrahedral Meshes Using Bisection
• Longest-edge \(n\)-section algorithms: properties and open problems
• Non-degeneracy study of the 8-tetrahedra longest-edge partition
• On \(C^1\)-complexes
• On the equivalence of ball conditions for simplicial finite elements in R^d
• On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
• On the non-degeneracy property of the longest-edge trisection of triangles
• Quality Local Refinement of Tetrahedral Meshes Based on Bisection
• Red refinements of simplices into congruent subsimplices
• Relationship between tetrahedron shape measures
• Verification of three-dimensional anisotropic adaptive processes

Cited in

(8)

• Triangular \(\sqrt 3\)-subdivision schemes: The regular case
• A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection
• A comparative study between some bisection based partitions in 3D
• Local refinement based on the 7-triangle longest-edge partition
• Finite number of similarity classes in longest edge bisection of nearly equilateral tetrahedra
• Strong regularity of a family of face-to-face partitions generated by the longest-edge bisection algorithm
• Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
• On the non-degeneracy property of the longest-edge trisection of triangles

This page was built for publication: On numerical regularity of trisection-based algorithms in 3D

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954441)