Near real-time CSG rendering using tree normalization and geometric pruning

A description is given of a set of algorithms for efficiently rendering an object defined by constructive solid geometry (CSG) directly onto a frame buffer without converting first to a boundary representation. This method requires only that the frame buffer contain sufficient memory to hold two color values, two depth values, and three one-bit flags. The algorithm first converts the CSG tree to a normalized form that is analogous to the sum-of-products form for Boolean switching functions. The following are developed: dynamic interleaving of Boolean tree normalization with bounding-box pruning, allowing efficient rendering for most CSG objects; a method for extending the technique to nonconvex primitives; and implementation of these ideas in an interactive CSG design system on the Pixel-planes 4 solid modeling system. In the design system the designer directly manipulates the CSG structure while continuously viewing the color rendering of the object being designed.<<ETX>>

[1]  Gilchrist,et al.  GMSolid: Interactive Modeling for Design and Analysis of Solids , 1982, IEEE Computer Graphics and Applications.

[2]  Frederik W. Jansen,et al.  Display of Solid Models with a Multi-Processor System , 1987, Eurographics.

[3]  Bruno Arnaldi,et al.  A New Algorithm of Space Tracing Using a CSG Model , 1987, Eurographics.

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

[5]  Gershon Kedem,et al.  Computer Structures for Curve-Solid Classification in Geometric Modeling , 1984 .

[6]  Frederik W. Jansen,et al.  A Pixel-Parallelhidden Surface Algorithm For Constructive Solid Geometry , 1986, Eurographics.

[7]  Peter R. Atherton,et al.  A scan-line hidden surface removal procedure for constructive solid geometry , 1983, SIGGRAPH.

[8]  James T. Kajiya,et al.  Ray tracing complex scenes , 1986, SIGGRAPH.

[9]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[10]  Yukinori Kakazu,et al.  Extended Depth-Buffer Algorithms for Hidden-Surface Visualization , 1984, IEEE Computer Graphics and Applications.

[11]  Frederick P. Brooks,et al.  Fast spheres, shadows, textures, transparencies, and imgage enhancements in pixel-planes , 1985, Advances in Computer Graphics.

[12]  Henry Fuchs,et al.  Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memories , 1989, SIGGRAPH.

[13]  Aristides A. G. Requicha,et al.  Depth-Buffering Display Techniques for Constructive Solid Geometry , 1986, IEEE Computer Graphics and Applications.

[14]  Bruce F. Naylor,et al.  Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.

[15]  Henry Fuchs,et al.  Fast constructive-solid geometry display in the pixel-powers graphics system , 1986, SIGGRAPH.