<?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="Sweep line algorithm - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Sweep_line_algorithm&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Sweep_line_algorithm&amp;p=3">3.Next</a>
</p>
<p>at some points. Geometric operations are restricted to geometric objects that either intersect or are in the immediate vicinity of the sweep line whenever it stops, and the complete solution is available once the line has passed over all objects.</p>

<p><big>Applications</big></p>
<p>An application of the approach had led to a breakthrough in the <a href="page.php?w=Analysis_of_algorithms">computational complexity</a> of geometric algorithms when <a href="page.php?w=Michael_Ian_Shamos">Shamos</a> and Hoey presented algorithms for <a href="page.php?w=line_segment_intersection">line segment intersection</a></p><p>
<a accesskey="1" href="page.php?w=Sweep_line_algorithm&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Sweep_line_algorithm&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
