On the adjacencies of triangular meshes based on skeleton-regular partitions
From MaRDI portal
Publication:1602807
DOI10.1016/S0377-0427(01)00484-8zbMATH Open0998.51010OpenAlexW2157124127MaRDI QIDQ1602807FDOQ1602807
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
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
Three-dimensional polytopes (52B10) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local mesh refinement in 2 and 3 dimensions
- Title not available (Why is that?)
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
- Local refinement of simplicial grids based on the skeleton
- Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
- Title not available (Why is that?)
- A recursive approach to local mesh refinement in two and three dimensions
- Mesh Refinement Processes Based on the Generalized Bisection of Simplices
- New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
- Selective refinement/derefinement algorithms for sequences of nested triangulations
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- Quality Local Refinement of Tetrahedral Meshes Based on Bisection
- Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
- Title not available (Why is that?)
- A 3D refinement/derefinement algorithm for solving evolution problems
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
- Mesh relaxation: A new technique for improving triangulations
- New trends in discrete and computational geometry
- On the Shape of Tetrahedra from Bisection
- Planar mesh refinement cannot be both local and regular
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)
