lation algorithm. Based on the paper "Sweep-line algorithm for constrained Delaunay triangulation" by V. Domiter and and B. Zalik </p>
<p>Properties:</p><ul>
<li>Creates triangles with a large interior angle.</li>
<li>Supports holes</li>
<li>Generate a lot of garbage due to incapsulation of the Poly2Tri library.</li>
<li>Running time is O(n^2), n = number of vertices.</li>
<li>Does not care about winding order.</li>
</ul>
</td></tr>
</table>

</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
