A triangulation algorithm for arbitrary planar domains

For finite element problems which involve irregular regions it is useful to have an automatic scheme capable of forming consistent, high-quality triangulations economically and efficiently. Existing computer algorithms tend either to be lacking in flexibility or inordinately time consuming. This algorithm was developed for the FEHPOL system and has significant advantages over previous methods. A flow chart and computer listing are included.