On the adjacencies of triangular meshes based on skeleton-regular partitions

Journal of Computational and Applied Mathematics

Volumn 140, Issue 1-2, 2002, Pages 673-693

  Plaza, Angel ^a   Rivara, María Cecilia ^b  

^a UNIVERSITY OF LAS PALMAS DE GRAN CANARIA   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Adjacencies; Partitions; Triangular and tetrahedral meshes

Indexed keywords

ASYMPTOTIC STABILITY; DIFFERENCE EQUATIONS; WIRE;

TRIANGULAR MESHES;

TRIANGULATION;

MATHEMATICAL ANALYSIS;

EID: 0036502979     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(01)00484-8     Document Type: Article

References (30)

1. Local mesh refinement in 2 and 3 dimensions
2. A general topology-based data structure
3. Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
4. Planar mesh refinement cannot be both local and regular
5. Tetrahedral mesh improvement using swapping and smoothing
6. Mesh relaxation: A new technique for improving triangulations
7. A recursive approach to local mesh refinement in two and two and three dimensions
8. On the shape of tetrahedra from bisection
9. Quality local refinement of tetrahedral meshes based on bisection
10. Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
11. Asymptotic behavior of the average adjacencies of the topological elements in some simplex partitions
12. A new refinement algorithm for tetrahedral grids based on bisection
13. Refinement of simplicial grids based on the skeleton
14. A 3D refinement/derefinement combination to solve evolution problems
15. Mesh refinement based on the generalized bisection of simplices
16. Selective refinement/derefinement algorithms for sequences of nested triangulations
17. The 4-triangles longest-side partition of triangles and linear refinement algorithms
18. New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
19. A 3D refinement algorithm suitable for adaptive and multigrid techniques
20. Cost analysis of the longest-side (triangle bisection) refinement algorithm for triangulations