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

DOI10.1002/CNM.1640110511MaRDI QIDQ4836600zbMATH OpenOpenAlexFDO

Authors

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)

Cites work

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

Cited in

(4)

• Error estimates and adaptive finite element methods. A bibliography (1990--2000)
• Automatic mesh generation on a regular background grid.
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• A new algorithm for triangular mesh generation by advancing front technique

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

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