A two dimensional mesh verification algorithm

Abstract

A two dimensional mesh verification algorithm is discussed which assumes that a finite element mesh is represented in a program by lists of data, i.e., vertex coordinates, element incidences, boundary data, which describe a collection of triangles. A set of conditions are placed on the triangles (i.e., on the list data) which ensure that the triangles tile a region and which also can be verified by the algorithm.