A generalized Delaunay triangulation algorithm with adaptive grid size control

DOI<941::AID-CNM121>3.0.CO;2-M 10.1002/(SICI)1099-0887(199712)13:12<941::AID-CNM121>3.0.CO;2-MzbMath0896.65097OpenAlexW2010551293MaRDI QIDQ4381961

T. Sundararajan, P. A. Aswatha Narayana, A. V. Ramesh Babu, K. S. Vasanth Kumar, K. N. Seetharamu

Publication date: 23 June 1998

Full work available at URL: https://doi.org/10.1002/(sici)1099-0887(199712)13:12<941::aid-cnm121>3.0.co;2-m

zbMATH Keywords

error estimategrid generationmesh refinementmesh coarseningadaptive grid size controlautomatic Delaunay triangulation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Error estimates and adaptive finite element methods ⋮ 2D and 3D finite element meshing and remeshing

Cites Work

• An apporach to automatic three-dimensional finite element mesh generation
• Selective refinement: A new strategy for automatic node placement in graded triangular meshes
• Generation of three‐dimensional unstructured grids by the advancing‐front method
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
• Robust boundary triangulation and delaunay triangulation of arbitrary planar domains
• Robust, geometrically based, automatic two‐dimensional mesh generation