There are simple and robust refinements (almost) as good as Delaunay

DOI10.1016/j.matcom.2012.06.001OpenAlexW1991815351MaRDI QIDQ2229908

Auxiliadora Moreno-González, José P. Suárez, Ángel Plaza, Alberto Márquez

Publication date: 18 February 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/38831

zbMATH Keywords

Delaunayedge-refinementlongest-edge

Mathematics Subject Classification ID

Numerical analysis (65-XX) Geometry (51-XX)

Uses Software

• Triangle

Cites Work

• Unnamed Item
• Unnamed Item
• A geometric diagram and hybrid scheme for triangle subdivision
• Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes
• Provably good mesh generation
• Delaunay refinement algorithms for triangular mesh generation
• Refinement based on longest-edge and self-similar four-triangle partitions
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms
• A Robust Implementation for Three-Dimensional Delaunay Triangulations
• The 4-triangles longest-side partition of triangles and linear refinement algorithms
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation