A Two-Dimensional Mesh Verification Algorithm
- 1 December 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 2 (4) , 455-473
- https://doi.org/10.1137/0902036
Abstract
A finite element mesh is usually represented in a program by lists of data, i.e., vertex coordinates, element incidences, boundary data. This paper is concerned with conditions on the list data which ensure that the lists describe a “tiling” of some planar region without overlap or gaps. For a particular format of lists, a set of such conditions is given which is proven to be sufficient to guarantee such a “tiling”. These conditions have been chosen so as to be verifiable by the algorithm referred to in the title, which is described in detail and is claimed to be of reasonable efficiency.Keywords
This publication has 10 references indexed in Scilit:
- A Linear Time Planarity Algorithm for 2-ComplexesJournal of the ACM, 1979
- Programming with Verification ConditionsIEEE Transactions on Software Engineering, 1979
- Automatic local refinement for irregular rectangular meshesInternational Journal for Numerical Methods in Engineering, 1979
- Triangulation of planar regions with applicationsThe Computer Journal, 1978
- Software for C1 Surface InterpolationPublished by Elsevier ,1977
- On the Angle Condition in the Finite Element MethodSIAM Journal on Numerical Analysis, 1976
- Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygonsInternational Journal for Numerical Methods in Engineering, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974
- Construction of curvilinear co‐ordinate systems and applications to mesh generationInternational Journal for Numerical Methods in Engineering, 1973