li>To use the trapezoid data, use ConvexPartitionTrapezoid()</li>
<li>Generate a lot of garbage due to incapsulation of the Poly2Tri library.</li>
<li>Running time is O(n log n), n = number of vertices.</li>
<li>Running time is almost linear for most simple polygons.</li>
<li>Does not care about winding order.</li>
</ul>
</td></tr>
<tr><td class="fieldname"><a id="a9b9c7a0ca1ff1abfaf566ac8f88ea9f4a6601e04d7cfa7c4f369d32e14b0ff0e2"></a>Delauny&#160;</td><td class="fielddoc"><p>2D constrained Delaunay triangu