A fast mesh generation algorithm with point-by-point Delaunay insertion

MaRDI QIDQ5436134zbMATH OpenFDO

Authors

Publication date 14 January 2008

zbMATH Keywords

Delaunay triangulationelement inserting coefficientFEMmesh generationpoint-by-point insertion

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Fast Delaunay triangulation in three dimensions
• Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation
• OPTIMAL DELAUNAY POINT INSERTION
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation

Cited in

(6)

• A point enrichment strategy for polygonal finite volume meshes
• A fast algorithm for point-location in a finite element mesh
• POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
• scientific article; zbMATH DE number 1015005 (Why is no real title available?)
• Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing
• scientific article; zbMATH DE number 5239201 (Why is no real title available?)

This page was built for publication: A fast mesh generation algorithm with point-by-point Delaunay insertion

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