Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygons

DOI10.1002/NME.1620100612zbMath0359.65091OpenAlexW2152829879MaRDI QIDQ4131584

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1002/nme.1620100612

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Related Items (6)

Global parameterization of a topological surface defined as a collection of trimmed bi-parametric patches: Application to automatic mesh construction ⋮ A framework for advancing front techniques of finite element mesh generation ⋮ A combined direct-iterative approach for solving large scale singular and rectangular consistent systems of linear equations ⋮ A data modeling abstraction for describing triangular mesh algorithms ⋮ An automatic coarse and fine surface mesh generation scheme based on medial axis transform. I: Algorithms ⋮ A new strategy for finite-element analysis of shell structures using trimmed quadrilateral shell meshes: a paving and cutting algorithm and a pentagonal shell element

This page was built for publication: Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygons