| 1. | The bit masks can be manipulated efficiently with Boolean operations.
|
| 2. | It supports subdivision surfaces, b-spline, NURBS and boolean operations.
|
| 3. | There is no easy Boolean operation to change these cases to the proper case.
|
| 4. | This permits organizing the set of all Boolean operations in the traditional list format.
|
| 5. | Early algorithms for Boolean operations on polygons were based on the use of bitmaps.
|
| 6. | Boolean operations, such as difference or intersection, may produce non-regular sets.
|
| 7. | Some Boolean operations, in particular do not have inverses that may be defined as functions.
|
| 8. | Propositional calculus restricts attention to abstract propositions, those built up from propositional variables using Boolean operations.
|
| 9. | Modern implementations for Boolean operations on polygons tend to use plane sweep algorithms ( or Sweep line algorithms ).
|
| 10. | A list of papers using plane sweep algorithms for Boolean operations on polygons can be found in References below.
|
