A Unified Algorithm for Boolean Shape Operations

Most algorithms for Boolean shape operations are complicated, slow, and of limited applicability. This one, based on a triangulation of potentially intersecting faces, is relatively fast and simple.