ist</span></code></dt><dd><p>Implementation of Weiler Atherton Algorithm for concave/convexe polygons clipping. Complexity is O(m*n).</p></dd></dl><dl><dt class="spec value" id="val-triangulation"><a href="#val-triangulation" class="anchor"></a><code><span class="keyword">val</span> triangulation : <a href="index.html#type-t">t</a> <span>&#45;&gt;</span> <span><span>(<a href="../Geoml/Point/index.html#type-t">Geoml.Point.t</a> * <a href="../Geoml/Point/index.html#type-t">Geoml.Point.t</a> * <a href="../Geom