Efficient parallel evaluation of CSG tree using fixed number of processors

Evaluation of CSG tree in a CSG based solid modeler is a very computationally intensive operation. In this paper we explore avenues for evaluating CSG trees by using multiple processors with shared memory. We propose a new parallel tree contraction algorithm, and apply the algorithm for parallel evaluation of CSG trees. Our algorithm is optimal as long as the number Of processors p, is smaller than O(n/ log n], where n is the number of leaf nodes in the CSG tree. We compare the performance of our algorithm with existing optimal tree contraction algorithms by implementing a ray casting of polygon problem in a BBN butterfly GP1OOO shared memory MIMD machine equipped with 2 clusters of 32 processors each. We have formulated the ray casting problem with seven difierent structures of the CSG trm, We have obtained uniformly better performance results for varying structures of the CSG

[1]  Robert B. Tilove,et al.  Set Membership Classification: A Unified Approach to Geometric Intersection Problems , 1980, IEEE Transactions on Computers.

[2]  Wojciech Rytter,et al.  An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications , 1986, FSTTCS.

[3]  Ibrahim Zeid,et al.  CAD/CAM theory and practice , 1991 .

[4]  Richard Cole,et al.  Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[6]  Robert E. Tarjan,et al.  Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) , 1984, FOCS.

[7]  Arthur L. Delcher,et al.  Optimal Parallel Evaluation of Tree-Structured Computations by Raking , 1988, AWOC.

[8]  Stephen Cameron,et al.  Efficient Intersection Tests for Objects Defined Constructively , 1989, Int. J. Robotics Res..

[9]  Robert B. Tilove.  A null-object detection algorithm for constructive solid geometry , 1984, CACM.

[10]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[11]  H. Voelcker,et al.  Solid modeling: current status and research directions , 1983, IEEE Computer Graphics and Applications.

[12]  J. R. Woodwark.  Eliminating redundant primitives from set-theoretic solid models by a consideration of constituents , 1988 .

[13]  Jarek Rossignac,et al.  Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection, and shading algorithms , 1988, TOGS.

[14]  Michael T. Goodrich,et al.  Generalized sweep methods for parallel computational geometry , 1990, SPAA '90.

[15]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.