Surface intersection using parallelism

Abstract The support of Boolean set operations in free-form solid modeling systems requires the repeated intersection of parametric surfaces. Present approaches to this problem are sequential and must make trade-offs between accuracy, robustness and efficiency. In this paper, we investigate a parallel approach to the surface intersection problem that shows, both theoretically and empirically, that with parallelism we can achieve both speed and precision simultaneously. We first develop a theoretical foundation for a subdivision method and derive complexity bounds. We show that the basic algorithm can be improved by parallelism. We then design two tolerance-based parallel subdivision algorithms, a macro-subdivision algorithm designed for MIMD shared memory machines and a lookahead-subdivision algorithm for pipelined MIMD machines. Empirical results on the Sequent Balance 21000, the Alliant FX/8, and the Cray-2 verify that significant speed-up is achievable.

[1]  Richard F. Riesenfeld,et al.  A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Malcolm S. Casale,et al.  An Overview of Analytic Solid Modeling , 1985, IEEE Computer Graphics and Applications.

[3]  Chaman L. Sabharwal,et al.  Implementation of a divide-and-conquer method for intersection of parametric surfaces , 1985, Comput. Aided Geom. Des..

[4]  William Joseph Fitzgerald,et al.  Solid modeling for production design , 1987 .

[5]  Gary A. Crocker,et al.  Boundary evaluation of non-convex primitives to produce parametric trimmed surfaces , 1987, SIGGRAPH '87.

[6]  John M. Levesque,et al.  A guidebook to Fortran on supercomputers , 1989 .

[7]  Michael I. Jordan,et al.  Surface/surface intersection , 1987, Comput. Aided Geom. Des..

[8]  Robert P. Markot,et al.  Surface algorithms using bounds on derivatives , 1986, Comput. Aided Geom. Des..

[9]  B. V. Herzen.  Applications of Surface Networks to Sampling Problems in Computer Graphics , 1988 .

[10]  Alan H. Barr,et al.  Geometric collisions for time-dependent parametric surfaces , 1990, SIGGRAPH.

[11]  R. Farouki.  Trimmed-surface algorithms for the evaluation and interrogation of solid boundary representations , 1987 .

[12]  Devendra Kalra,et al.  Guaranteed ray intersections with implicit surfaces , 1989, SIGGRAPH.

[13]  J. Lane,et al.  A generalized scan line algorithm for the computer display of parametrically defined surfaces , 1979 .

[14]  James H. Patterson,et al.  Portable Programs for Parallel Processors , 1987 .

[15]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .