On numerical regularity of trisection-based algorithms in 3D
From MaRDI portal
Publication:2954441
DOI10.1007/978-3-319-32857-7_35zbMATH Open1355.65033OpenAlexW2508187310MaRDI QIDQ2954441FDOQ2954441
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
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
- Local mesh refinement in 2 and 3 dimensions
- Locally Adapted Tetrahedral Meshes Using Bisection
- On the equivalence of ball conditions for simplicial finite elements in \(\mathbf R^d\)
- Title not available (Why is that?)
- On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
- On \(C^1\)-complexes
- Local refinement of simplicial grids based on the skeleton
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- Verification of three-dimensional anisotropic adaptive processes
- Relationship between tetrahedron shape measures
- A recursive approach to local mesh refinement in two and three dimensions
- An analysis of simplex shape measures for anisotropic meshes
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- A comparative study between some bisection based partitions in 3D
- Longest-edge \(n\)-section algorithms: properties and open problems
- On the non-degeneracy property of the longest-edge trisection of triangles
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- Quality Local Refinement of Tetrahedral Meshes Based on Bisection
- Title not available (Why is that?)
- A 3D refinement/derefinement algorithm for solving evolution problems
- Title not available (Why is that?)
- Computational aspects of the refinement of 3D tetrahedral meshes
- Red refinements of simplices into congruent subsimplices
Cited In (7)
- Triangular \(\sqrt 3\)-subdivision schemes: The regular case
- 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
- A comparative study between some bisection based partitions in 3D
- Local refinement based on the 7-triangle longest-edge partition
- Strong regularity of a family of face-to-face partitions generated by the longest-edge bisection algorithm
- Finite number of similarity classes in longest edge bisection of nearly equilateral tetrahedra
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)
