An efficient data structure for the advancing‐front triangular mesh generation technique

DOI10.1002/cnm.1640110511zbMath0824.65120OpenAlexW2071470374MaRDI QIDQ4836600

No author found.

Publication date: 19 June 1995

Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1640110511

zbMATH Keywords

mesh generationefficient data structureadvancing-front triangular generationupdating front process

Mathematics Subject Classification ID

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

Related Items (3)

Automatic mesh generation on a regular background grid. ⋮ Error estimates and adaptive finite element methods ⋮ 2D and 3D finite element meshing and remeshing

Cites Work

• Adaptive remeshing for compressible flow computations
• Some useful data structures for the generation of unstructured grids
• Finite element Euler computations in three dimensions
• An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems

This page was built for publication: An efficient data structure for the advancing‐front triangular mesh generation technique