Department of Manufacturing Engineering, Beijing Institute of Aeronautics and Astronautics, Beijing, China
Abstract:
The well-established algorithm of realizing Boolean operations between 2D configurations can be readily extended to 3D solids when the latter is represented in the form of a set of bounding faces and loops. Such an approach takes advantage of the topological coherence between neighbouring elements of a solid and hence is computationally more efficient than the set membership classification method.