Automatic mesh generation on a regular background grid.

DOI10.1007/BF02960780zbMath1048.65122OpenAlexW2006676757MaRDI QIDQ1433973

S. Rajasekar

Publication date: 1 July 2004

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02960780

zbMATH Keywords

triangular meshautomatic mesh generationboundary recoveryregular background grid

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items

Generation of finite element mesh with variable size over an unbounded 2D domain ⋮ Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain

Cites Work

• Automatic mesh generator with specified boundary
• Delaunay triangulation of non-convex planar domains
• A new mesh generation scheme for arbitrary planar domains
• A scheme for the automatic generation of triangular finite elements
• Paving: A new approach to automated quadrilateral mesh generation
• A new approach to the development of automatic quadrilateral mesh generation
• Modification to the Suhara-Fukuda method of network generation
• ASPECTS OF 2-D DELAUNAY MESH GENERATION
• NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
• Robust, geometrically based, automatic two‐dimensional mesh generation
• Automatic triangulation of arbitrary planar domains for the finite element method
• An efficient data structure for the advancing‐front triangular mesh generation technique