Boolean Operations on n-Dimensional Objects
- 1 June 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 6 (6) , 43-51
- https://doi.org/10.1109/mcg.1986.276741
Abstract
Computation of the union, intersection, and difference of n-dimensional objects plays a central role in several computer-aided geometric design problems. An algorithm for computing these operations that uses a boundary classification technique is presented here. The algorithm is recursive in structure, with the recursion being on the dimensions of objects dealt with at each stage. The representation treats all entities as objects, making no distinction between faces, edges, or vertices. The objects produced are "regularized"; that is, there are no degenerate boundaries such as dangling edges. The sample application given involves hidden-surface removal.Keywords
This publication has 7 references indexed in Scilit:
- Representations for Rigid Solids: Theory, Methods, and SystemsACM Computing Surveys, 1980
- Closure of Boolean operations on geometric entitiesComputer-Aided Design, 1980
- Polygon comparison using a graph representationPublished by Association for Computing Machinery (ACM) ,1980
- A Geometric Modeling System for Automated Mechanical AssemblyIBM Journal of Research and Development, 1980
- The PADL-1.0/2 system for defining and displaying solid objectsPublished by Association for Computing Machinery (ACM) ,1978
- Hidden surface removal using polygon area sortingACM SIGGRAPH Computer Graphics, 1977
- Reentrant polygon clippingCommunications of the ACM, 1974