Robust set operations on polyhedral solids
- 1 November 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 9 (6), 50-59
- https://doi.org/10.1109/38.41469
Abstract
An algorithm for performing regularized Boolean operation on polyhedral solids is described. Robustness is achieved by adding symbolic reasoning as a supplemental step to resolve possible numerical uncertainty. Additionally, numerical redundancy and numerical computation based on derived quantities are reduced as much as possible. Experience with an implementation of the algorithm, using a unit-cube example as a simple test object for robustness, is discussed.Keywords
This publication has 8 references indexed in Scilit:
- Towards implementing robust geometric computationsPublished by Association for Computing Machinery (ACM) ,1988
- Primitives for the manipulation of three-dimensional subdivisionsPublished by Association for Computing Machinery (ACM) ,1987
- On the coordinatization of oriented matroidsDiscrete & Computational Geometry, 1986
- Constructive solid geometry for polyhedral objectsACM SIGGRAPH Computer Graphics, 1986
- Boolean operations of 2-manifolds through vertex neighborhood classificationACM Transactions on Graphics, 1986
- Boolean operations in solid modeling: Boundary evaluation and merging algorithmsProceedings of the IEEE, 1985
- A Geometric Modeling System for Automated Mechanical AssemblyIBM Journal of Research and Development, 1980
- The synthesis of solids bounded by many facesCommunications of the ACM, 1975