Red–green refinement of simplicial meshes in $d$ dimensions
From MaRDI portal
Publication:4561371
DOI10.1090/mcom/3383zbMath1497.65154OpenAlexW2809685987MaRDI QIDQ4561371
Publication date: 5 December 2018
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3383
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)
Related Items
On degenerating tetrahedra resulting from red refinements of tetrahedral partitions, On degenerating finite element tetrahedral partitions, On Regularity of Tetrahedral Meshes Produced by Some Red-Type Refinements, Optimal operator preconditioning for pseudodifferential boundary problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangulations. Structures for algorithms and applications
- The computation of fixed points and applications
- An algorithm for adaptive mesh refinement in \(n\) dimensions
- Edgewise subdivision of a simplex
- Space-time finite element methods for elastodynamics: Formulations and error estimates
- Discrete groups generated by reflections
- Tetrahedral grid refinement
- Simplizialzerlegungen von beschränkter Flachheit
- Adaptive Finite Element Methods for Parabolic Problems I: A Linear Model Problem
- Simplex space–time meshes in finite element simulations
- Design and data structure of fully adaptive, multigrid, finite-element software
- Some Combinatorial Lemmas in Topology
- Local mesh refinement in 2 and 3 dimensions
- Adaptive multivlevel methods in three space dimensions
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- A comparison of adaptive refinement techniques for elliptic problems
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
- Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision
- Greedy bisection generates optimally adapted triangulations
- The completion of locally refined simplicial partitions created by bisection
- Algorithms and Data Structures
- UG -- a flexible software toolbox for solving partial differential equations
