An Algorithm Of 3D Boolean Operation Based On Declining Method

Recently, constructing entity based on computer aided modeling is one of the most efficient and most widely used method, and it has proved that Boolean Operation plays a very important role in such constructing process. 2D Boolean Operation is commonly applied to two dimensional modeling and low dimensional computing for 3D modeling; 3D Boolean Operation applied broader in kinds of fields, such as design and manufacture in engineering, computer aided teach, animate design and so on, it is accepted as the fundamental part of computer aided construction.The kernel problem of 3D Boolean Operation is to find the solution of singular problems caused by co-point, collinear or coplanar between operate objects, which impact the stability of this algorithm and conduce the usability of the system directly.This paper talks about a method for Boolean operations on solids with bounday representation. We try to reduce a basically 3D problem to a 2D one, in the purpose of decreasing compute complexity and solving singular problems. After a brief introduction of Three Dimensional Boolean Operation concepts, we illustrated the way how to decrease the procedure from three dimension to two dimension, and discussed on those singular problems, so that we can get the three dimensional topological information. We have simplified the algorithm of 3D Boolean Operation a lot, and improved the stability mentioned above.To validate this method, we have implemented the algorithm on KerenCAD platform, and tested on kinds of complex and singular instances successfully, the result shows it is robust.