A Two-Dimensional Mesh Verification Algorithm

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.