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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: SIAM Journal on Scientific and Statistical Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
