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

DOI10.1016/S0377-0427(01)00484-8MaRDI QIDQ1602807zbMATH OpenOpenAlexFDO

Authors Ángel Plaza, Maria-Cecilia Rivara

Publication date 24 June 2002

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-0427(01)00484-8

zbMATH Keywords

adjacenciesskeleton-regular partitiontriangular and tetrahedral meshes

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Recommendations

• Average adjacencies for tetrahedral skeleton-regular partitions
• scientific article; zbMATH DE number 2029425
• Non-degeneracy study of the 8-tetrahedra longest-edge partition
• Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
• The propagation problem in the four-triangle longest-edge refinement

Cites work

• scientific article; zbMATH DE number 3720310 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3528420 (Why is no real title available?)
• scientific article; zbMATH DE number 1255561 (Why is no real title available?)
• scientific article; zbMATH DE number 1143749 (Why is no real title available?)
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• A 3D refinement/derefinement algorithm for solving evolution problems
• A recursive approach to local mesh refinement in two and three dimensions
• Geometry. I, II. Transl. from the French by M. Cole and S. Levy
• Local mesh refinement in 2 and 3 dimensions
• Local refinement of simplicial grids based on the skeleton
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices
• Mesh relaxation: A new technique for improving triangulations
• New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
• New trends in discrete and computational geometry
• On the Shape of Tetrahedra from Bisection
• Planar mesh refinement cannot be both local and regular
• Quality Local Refinement of Tetrahedral Meshes Based on Bisection
• Selective refinement/derefinement algorithms for sequences of nested triangulations
• Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
• Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
• The 4-triangles longest-side partition of triangles and linear refinement algorithms

Cited in

(7)

• Two algorithms for fast 2D node generation: application to RBF meshless discretization of diffusion problems and image halftoning
• Block-balanced meshes in iterative uniform refinement
• Non-equivalent partitions of \(d\)-triangles with Steiner points
• Dimensions of exactly divergence-free finite element spaces in 3D
• Average adjacencies for tetrahedral skeleton-regular partitions
• Low cardinality admissible meshes on quadrangles, triangles and disks
• Non-degeneracy study of the 8-tetrahedra longest-edge partition

This page was built for publication: On the adjacencies of triangular meshes based on skeleton-regular partitions

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