BOOLE: A System to Compute Boolean Combinations of Sculptured Solids

Shankar Muthu Krishnan, Atul Narkhede, Dinesh Manocha · 1995

We present a system to compute Boolean combinations of sculptured solids. The surface of each solid is represented as a collection of trimmed and untrimmed spline surfaces and a connectivity graph. Based on algorithms for trapezoidation of polygons, partitioning of polygons using polygonal chains, surface intersection of high degree spline surfaces and rayshooting, we compute the boundaries of the resulting solids and its connectivity graph after the Boolean operation. This system has been tested on a number of large scale industrial models, and it performs well. The system can also handle degenerate cases which occur frequently in practice. 1 Introduction The field of solid modeling deals with design and representation of physical objects. The two major representation schemata used in solid modeling are constructive solid geometry (CSG) and boundary representations (B-rep). Both these representations have different inherent strengths and weaknesses, and for most applications both are...

Read the paper · More papers on PaperTik