<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> <html> <head> <link rel="stylesheet" href="style.css" type="text/css"> <meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type"> <link rel="Start" href="index.html"> <link rel="previous" href="Delaunay.IntPoints.html"> <link rel="next" href="Delaunay.FloatPoints.html"> <link rel="Up" href="Delaunay.html"> <link title="Index of types" rel=Appendix href="index_types.html"> <link title="Index of exceptions" rel=Appendix href="index_exceptions.html"> <link title="Index of values" rel=Appendix href="index_values.html"> <link title="Index of modules" rel=Appendix href="index_modules.html"> <link title="Index of module types" rel=Appendix href="index_module_types.html"> <link title="Sig" rel="Chapter" href="Sig.html"> <link title="Sig_pack" rel="Chapter" href="Sig_pack.html"> <link title="Dot_ast" rel="Chapter" href="Dot_ast.html"> <link title="Util" rel="Chapter" href="Util.html"> <link title="Persistent" rel="Chapter" href="Persistent.html"> <link title="Imperative" rel="Chapter" href="Imperative.html"> <link title="Delaunay" rel="Chapter" href="Delaunay.html"> <link title="Builder" rel="Chapter" href="Builder.html"> <link title="Classic" rel="Chapter" href="Classic.html"> <link title="Rand" rel="Chapter" href="Rand.html"> <link title="Oper" rel="Chapter" href="Oper.html"> <link title="Path" rel="Chapter" href="Path.html"> <link title="Traverse" rel="Chapter" href="Traverse.html"> <link title="Coloring" rel="Chapter" href="Coloring.html"> <link title="Topological" rel="Chapter" href="Topological.html"> <link title="Components" rel="Chapter" href="Components.html"> <link title="Kruskal" rel="Chapter" href="Kruskal.html"> <link title="Flow" rel="Chapter" href="Flow.html"> <link title="Graphviz" rel="Chapter" href="Graphviz.html"> <link title="Gml" rel="Chapter" href="Gml.html"> <link title="Dot" rel="Chapter" href="Dot.html"> <link title="Pack" rel="Chapter" href="Pack.html"> <link title="Gmap" rel="Chapter" href="Gmap.html"> <link title="Minsep" rel="Chapter" href="Minsep.html"> <link title="Cliquetree" rel="Chapter" href="Cliquetree.html"> <link title="Mcs_m" rel="Chapter" href="Mcs_m.html"> <link title="Md" rel="Chapter" href="Md.html"> <link title="Strat" rel="Chapter" href="Strat.html"><title>Delaunay.Int</title> </head> <body> <div class="navbar"><a href="Delaunay.IntPoints.html">Previous</a> <a href="Delaunay.html">Up</a> <a href="Delaunay.FloatPoints.html">Next</a> </div> <center><h1>Module <a href="type_Delaunay.Int.html">Delaunay.Int</a></h1></center> <br> <pre><span class="keyword">module</span> Int: <code class="type"><a href="Delaunay.Triangulation.html">Triangulation</a></code><code class="type"> with module S = IntPoints</code></pre>Delaunay triangulation with integer coordinates<br> <hr width="100%"> <pre><span class="keyword">module</span> <a href="Delaunay.Triangulation.S.html">S</a>: <code class="type"><a href="Delaunay.CCC.html">Delaunay.CCC</a></code><code class="type"> </code></pre><pre><span class="keyword">type</span> <a name="TYPEtriangulation"></a><code class="type"></code>triangulation </pre> <pre><span class="keyword">val</span> <a name="VALtriangulate"></a>triangulate : <code class="type">S.point array -> <a href="Delaunay.Triangulation.html#TYPEtriangulation">triangulation</a></code></pre><div class="info"> <code class="code">triangulate a</code> computes the Delaunay triangulation of a set of points, given as an array <code class="code">a</code>. If <code class="code">N</code> is the number of points (that is <code class="code">Array.length a</code>), then the running time is $O(N \log N)$ on the average and $O(N^2)$ on the worst-case. The space used is always $O(N)$.<br> </div> <pre><span class="keyword">val</span> <a name="VALiter"></a>iter : <code class="type">(S.point -> S.point -> unit) -> <a href="Delaunay.Triangulation.html#TYPEtriangulation">triangulation</a> -> unit</code></pre><div class="info"> <code class="code">iter f t</code> iterates over all edges of the triangulation <code class="code">t</code>. <code class="code">f u v</code> is called once for each undirected edge <code class="code">(u,v)</code>.<br> </div> <pre><span class="keyword">val</span> <a name="VALfold"></a>fold : <code class="type">(S.point -> S.point -> 'a -> 'a) -><br> <a href="Delaunay.Triangulation.html#TYPEtriangulation">triangulation</a> -> 'a -> 'a</code></pre></body></html>