A study on size-optimal longest edge refinement algorithms

DOI10.1007/978-3-642-33573-0_8MaRDI QIDQ7357213zbMATH OpenFDO

Authors Carlos Bedregal, Maria-Cecilia Rivara

Publication date 25 September 2026

Full work available at URL https://doi.org/10.1007/978-3-642-33573-0_8

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Adaptive refinement of unstructured finite-element meshes
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• An algorithm for adaptive refinement of triangular element meshes
• ASPECTS OF 2-D DELAUNAY MESH GENERATION
• Complexity of the bisection method
• Delaunay refinement algorithms for triangular mesh generation
• Design and data structure of fully adaptive, multigrid, finite-element software
• scientific article; zbMATH DE number 1795894 (Why is no real title available?)
• Lepp-bisection algorithms, applications and mathematical properties
• Multithread parallelization of LEPP-bisection algorithms
• New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
• Nonobtuse triangulation of polygons
• Provably good mesh generation
• Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes

This page was built for publication: A study on size-optimal longest edge refinement algorithms

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