Red-green refinement of simplicial meshes in d dimensions

DOI10.1090/MCOM/3383MaRDI QIDQ4561371zbMATH OpenOpenAlexFDO

Authors Jörg Grande

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

zbMATH Keywords

green closureKuhn triangulationlocal mesh refinementred-green refinementsimplicial meshes

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Recommendations

• On simplicial red refinement in three and higher dimensions.
• Red refinements of simplices into congruent subsimplices
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices
• Isotropic refinement and recoarsening in two dimensions
• Local mesh refinement in 2 and 3 dimensions

Cites work

• A comparison of adaptive refinement techniques for elliptic problems
• Adaptive Finite Element Methods for Parabolic Problems I: A Linear Model Problem
• Adaptive multivlevel methods in three space dimensions
• Algorithms and Data Structures
• An algorithm for adaptive mesh refinement in \(n\) dimensions
• Design and data structure of fully adaptive, multigrid, finite-element software
• Discrete groups generated by reflections
• Edgewise subdivision of a simplex
• Greedy bisection generates optimally adapted triangulations
• scientific article; zbMATH DE number 3958638 (Why is no real title available?)
• scientific article; zbMATH DE number 1049272 (Why is no real title available?)
• scientific article; zbMATH DE number 1175969 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• scientific article; zbMATH DE number 3244470 (Why is no real title available?)
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• Local mesh refinement in 2 and 3 dimensions
• polymake: a framework for analyzing convex polytopes
• Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision
• Simplex space–time meshes in finite element simulations
• Simplizialzerlegungen von beschränkter Flachheit
• Some Combinatorial Lemmas in Topology
• Space-time finite element methods for elastodynamics: Formulations and error estimates
• Tetrahedral grid refinement
• The 4-triangles longest-side partition of triangles and linear refinement algorithms
• The completion of locally refined simplicial partitions created by bisection
• The computation of fixed points and applications
• Triangulations. Structures for algorithms and applications
• UG -- a flexible software toolbox for solving partial differential equations

Cited in

(9)

• Red refinements of simplices into congruent subsimplices
• A coarsening algorithm on adaptive red-green-blue refined meshes
• Optimal operator preconditioning for pseudodifferential boundary problems
• On degenerating finite element tetrahedral partitions
• On simplicial red refinement in three and higher dimensions.
• On degenerating tetrahedra resulting from red refinements of tetrahedral partitions
• On regularity of tetrahedral meshes produced by some red-type refinements
• Full discretization and regularization for the Calderón problem
• Construction of 4D simplex space-time meshes for local bisection schemes

Describes a project that uses

Uses Software

• UG
• CGAL
• polymake
• DROPS

This page was built for publication: Red-green refinement of simplicial meshes in \(d\) dimensions

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