A Unified Algorithm for Boolean Shape Operations
- 1 June 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 4 (6) , 24-37
- https://doi.org/10.1109/mcg.1984.275959
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.Keywords
This publication has 6 references indexed in Scilit:
- Sub-30-nm FUSI CMOS Transistors Fabricated by Simple Method Without Additional CMP ProcessIEEE Electron Device Letters, 2008
- Surface Triangulation for Picture ProductionIEEE Computer Graphics and Applications, 1983
- GWB: A Solid Modeler with Euler OperatorsIEEE Computer Graphics and Applications, 1982
- Representations for Rigid Solids: Theory, Methods, and SystemsACM Computing Surveys, 1980
- Geometric Modeling of Mechanical Parts and ProcessesComputer, 1977
- The synthesis of solids bounded by many facesCommunications of the ACM, 1975