<?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="Monotone polygon - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=monotone_polygon&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=monotone_polygon&amp;p=6">3.Next</a>
</p>
<p>preprocessing (to find the leftmost and rightmost vertices).</p>

<p>A monotone polygon may be easily <a href="page.php?w=polygon_triangulation">triangulated</a> in linear time.</p>

<p>For a given set of points in the plane, a <a href="page.php?w=bitonic_tour">bitonic tour</a> is a monotone polygon that connects the points. The minimum <a href="page.php?w=perimeter">perimeter</a> bitonic tour for a given point set with respect to a fixed direction may be found in <a href="page.php?w=polynomial_time">polynomial time</a> using <a href="page.php?w=dynamic_programming">dynamic programming</a>.</p><p>
<a accesskey="1" href="page.php?w=monotone_polygon&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=monotone_polygon&amp;p=6">3.Next</a>
</p>

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

</card>
</wml>
