Triangulations

As part of a project developed by Professor Bradley J. Lucier, to code a PDE solver written in Scheme, I worked in some algorithms to perform "good triangulations" of polygons with holes ("good triangulations" meaning here, those where all the triangles have their three angles as close to 60º as possible). I obtained the necessary theoretical background and coding strategies from the following references:

• Mark de Berg et al., "Computational Geometry by Example."
• Francis Chin and Cao An Wang, "Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a simple Polygon in Linear Time."
• Joseph O'Rourke, "Computational Geometry in C."
• Jim Ruppert, "A Delaunay Refinement Algorithm for Quality 2-dimensional Mesh Generation."