Propagation of longest-edge mesh patterns in local adaptive refinement
From MaRDI portal
Recommendations
Cites work
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- A mesh-refinement scheme for finite element computations
- scientific article; zbMATH DE number 1255561 (Why is no real title available?)
- Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Parallel Algorithms for Adaptive Mesh Refinement
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
Cited in
(6)- Local refinement based on the 7-triangle longest-edge partition
- Hamiltonian triangular refinements and space-filling curves
- Four-triangles adaptive algorithms for RTIN terrain meshes
- The propagation problem in the four-triangle longest-edge refinement
- Longest-edge \(n\)-section algorithms: properties and open problems
- On the non-degeneracy property of the longest-edge trisection of triangles
This page was built for publication: Propagation of longest-edge mesh patterns in local adaptive refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515054)