Boolean Operations On Polygons - Uses in Software

Uses in Software

Early algorithms for Boolean operations on polygons were based on the use of bitmaps. 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 number of bits is required.

Modern implementations for Boolean operations on polygons tend to use plane sweep algorithms (or Sweep line algorithms). A list of papers using plane sweep algorithms for Boolean operations on polygons can be found in References below.

Boolean operations on convex polygons and monotone polygons of the same direction may be performed in linear time.

Read more about this topic:  Boolean Operations On Polygons

Other articles related to "uses in software, software":

Chilli Spot - Uses in Software
... FON ChilliSpot is used in FON's FONSPOT software that turns a regular Mac/Linux/PC machine into a FON spot ...