<?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="Boolean operations on polygons - Page 3 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=boolean_operations_on_polygons&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=boolean_operations_on_polygons&amp;p=4">3.Next</a>
</p>
<p><a href="page.php?w=Weiler-Atherton_clipping_algorithm">Weiler-Atherton clipping algorithm</a> (special case algorithm)</p>

<p><big> Uses in software </big></p>
<p>Early algorithms for Boolean operations on polygons were based on the use of <a href="page.php?w=bitmaps">bitmaps</a>. Using bitmaps in modeling polygon shapes has many drawbacks. One of the drawbacks is that the memory usage can be very large, since the resolution of polygons is proportional to the number of bits used to represent polygons. The higher the resolution is desired, the more the</p><p>
<a accesskey="1" href="page.php?w=boolean_operations_on_polygons&amp;p=2">1.Previous</a><br />
<a accesskey="3" href="page.php?w=boolean_operations_on_polygons&amp;p=4">3.Next</a>
</p>

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

</card>
</wml>
