Rapid previewing via volume-based solid modeling

Quick previewing of 3D models is necessary for efficient product design and rapid prototyping. An inherent weakness of most solid modeling systems is that as model complexity increases, quick 3D viewing suffers, especially on low cost workstations. We explore an alternative approach to surface representation in which object space, called volume, is subdivided into a 3D grid of cubic cells, each containing information on the object(s) which occupy it. A data structure is introduced that consists of a 2D amay of pointers each holding a linked list of adjacent non empty cells. To benefit from data coherency along one dimension, we have developed new modeling and rendering algorithms that are beam-oriented, incremental, and integer-based. To illustrate the usefulness of our approach, we use it in Constructive Solid Geometry (CSG) modeling. We describe our prototype system and show, by comparing it to existing systems, that our data structure and its associated algorithms, while being of finite resolution, provide for suitable and more efficient model visualization.

[1]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[2]  R. Nagel,et al.  3-D Visual simulation , 1971 .

[3]  Dan Gordon,et al.  Back-to-Front Display of Voxel Based Objects , 1985, IEEE Computer Graphics and Applications.

[4]  Lee Westover,et al.  Footprint evaluation for volume rendering , 1990, SIGGRAPH.

[5]  Bruce F. Naylor,et al.  Interactive solid geometry via partitioning trees , 1992 .

[6]  Raghu Machiraju,et al.  Efficient feed-forward volume rendering techniques for vector and parallel processors , 1993, Supercomputing '93. Proceedings.

[7]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[8]  Roberto Scopigno,et al.  Rendering volumetric data using STICKS representation scheme , 1990, SIGGRAPH 1990.

[9]  Hanan Samet,et al.  Hierarchical data structures and algorithms for computer graphics. II. Applications , 1988, IEEE Computer Graphics and Applications.

[10]  Arie E. Kaufman Volume visualization , 1996, CSUR.

[11]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[12]  Daniel Cohen-Or,et al.  Volume graphics , 1993, Computer.

[13]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[14]  Hanan Samet,et al.  Hierarchical data structures and algorithms for computer graphics. I. Fundamentals , 1988, IEEE Computer Graphics and Applications.

[15]  C. Montani,et al.  Rendering volumetric data using STICKS representation scheme , 1990, VVS.

[16]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[17]  Jayaram K. Udupa,et al.  Fast surface tracking in three-dimensional binary images , 1989, Comput. Vis. Graph. Image Process..

[18]  Arie Kaufman,et al.  Volume Visualization (Tutorial) , 1991 .

[19]  Jayaram K. Udupa,et al.  Fast visualization, manipulation, and analysis of binary volumetric objects , 1991, IEEE Computer Graphics and Applications.