<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Fortune&#039;s algorithm - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=Fortune%27s_algorithm&amp;p=2">3.Next</a>
</p>
<p><b>Fortune's algorithm</b> is a <a href="page.php?w=sweep_line_algorithm">sweep line algorithm</a> for generating a <a href="page.php?w=Voronoi_diagram">Voronoi diagram</a> from a set of points in a plane using <a href="page.php?w=Big_O_notation">O</a>(n&nbsp;log&nbsp;n) time and O(n) space. It was originally published by <a href="page.php?w=Steven_Fortune">Steven Fortune</a> in 1986 in his paper "A sweepline algorithm for Voronoi diagrams."</p>

<p><big> Algorithm description </big></p>
<p>The algorithm maintains both a <a href="page.php?w=sweep_line">sweep line</a></p><p>
<a accesskey="3" href="page.php?w=Fortune%27s_algorithm&amp;p=2">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
