Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygons
From MaRDI portal
Publication:4131584
DOI10.1002/NME.1620100612zbMATH Open0359.65091OpenAlexW2152829879MaRDI QIDQ4131584FDOQ4131584
Authors: A. Bykat 
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
Cited In (6)
- A framework for advancing front techniques of finite element mesh generation
- Global parameterization of a topological surface defined as a collection of trimmed bi-parametric patches: Application to automatic mesh construction
- 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
- A combined direct-iterative approach for solving large scale singular and rectangular consistent systems of linear equations
- An automatic coarse and fine surface mesh generation scheme based on medial axis transform. I: Algorithms
- A data modeling abstraction for describing triangular mesh algorithms
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131584)
