Boolean operations on polygons

These sets of operations are widely used in computer graphics, CAD, and in EDA (in integrated circuit physical design and verification software).

Early algorithms for Boolean operations on polygons were based on the use of bitmaps.

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.