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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call