A Unified Algorithm for Boolean Shape Operations

  • Authors:

  • Fujio Yamaguchi;Toshiya Tokieda

  • Affiliations:

  • Kyushu Institute of Design;Kyushu Institute of Design

  • Venue:
  • IEEE Computer Graphics and Applications
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.