6 results
Search Results
Now showing 1 - 6 of 6
Item Template-Based Volume Viewing(Blackwell Science Ltd and the Eurographics Association, 1992) Yagel, Roni; Kaufman, ArieWe present an efficient three-phase algorithm for volume viewing that is based on exploiting coherency between rays in parallel projection. The algorithm starts by building a ray-template and determining a special plane for projection - the base-plane. Parallel rays are cast into the volume from within the projected region of the volume on the base-plane, by repeating the sequence of steps specified in the ray-template. We carefully choose the type of line to be employed and the way the template is being placed on the base-plane in order to assure uniform sampling of the volume by the discrete rays. We conclude by describing an optimized software implementation of our algorithm and reporting its performance.Item Three Architectures for Volume Rendering(Blackwell Science Ltd and the Eurographics Association, 1995) Hesser, Jurgen; Manner, Reinhard; Knittel, Gunter; Strasser, Wolfgang; Pfister, Hanspeter; Kaufman, ArieVolume rendering is a key technique in scientific visualization that lends itself to significant exploitable parallelism. The high computational demands of real-time volume rendering and continued technological advances in the area of VLSl give impetus to the development of special-purpose volume rendering architectures. This paper presents and characterizes three recently developed volume rendering engines which are based on the ray-casting method. A taxonomy of the algorithmic variants of ray-casting and details of each ray-casting architecture are discussed. The paper then compares the machinefeatures and provides an outlook onfuture developments in the area of volume rendering hardware.Item A 3-D CELLULAR FRAME BUFFER(The Eurographics Association, 1985) Kaufman, Arie; Bakalash, Reuven; C.E. VandoniA new architecture for storing and processing of threedimensional (3-D) graphics is described, The 3-D objects are discretized and stored in a full 3-D cellular memory of voxels. A 3-D graphics processor scan-converts 3-D geometric objects into the cellular representation. A 3-D frame buffer processor manipulates 3-D cellular sub-boxes and controls 3-D interaction. Displaying 2-D orthographic projections from a given view position and direction is accomplished by a 3-D viewing processor. With this new architecture, there is neither a need for repeatedly scan-converting modified geometric objects nor a need for removing hidden-surfaces.Item Forest of Quadtrees: An Object Representation for 3D Graphics(Eurographics Association, 1989) Kaufman, Arie; Bandopadhay, AmitA forest of quadtrees is proposed as an alternative data structure for representing and manipulating 3D and 2.5D graphics. A data representation of a forest offers space savings over common quadtrees by concentrating the vital information and discarding unused pointers. Several properties of the forest of quadtrees and the basic operations for display and elementary transformations like rotation, reflection, enlargement, reduction, and translation are investigated. Specifically, the temporary memory requirements and duplication time of the algorithms are analyzed.Item Memory Organization for a Cubic Frame Buffer(The Eurographics Association, 1986) Kaufman, Arie; A.A.G. RequichaA special memory organization of a cubic voxel-based frame buffer is presented. The memory of voxels is divided into n modules of voxels each. The k-th module groups together all the principal diagonal planes within the cubic frame buffer, that their sequential index is k mod (n ). This organization guarantees that all the n voxels which constitute a row in any direction parallel to the axes reside in different modules, permitting the retrieval of all the voxels of a row simultaneously. This memory layout is the heart of a voxel-based CUBE Architecture for three-dimensional graphics. The architecture employs three processors which access the memory, to input, manipulate, and view the image within the memory. The unique memory organization enables these processors and the entire system to cope with real-time constraints.Item An Algorithm for 3D Scan-Conversion of Polygons(Eurographics Association, 1987) Kaufman, ArieA three-dimensional (3D) scan-conversion algorithm, that scanconverts 3D planar polygons into their discrete voxel-map representation within a Cubic Frame Buffer (CFB), is presented. The algorithm, which is a variation of a 2D scan-line filling algorithm, is incremental and uses only simple operations like additions and testy inside the inner loops. The algorithm performs scan-conversion with computational complexity which is linear in the number of voxels written to the CFB. The paper also presents an algorithm that scan-converts polygons clipped to the CFB boundaries with no added time complexity. An all-integer decision mechanism which makes the inner-most loop of the algorithm more efficient is discussed too. All the algorithms guarantee lack of 6-connected "tunnels" in the converted polygons. The algorithms have been implemented as part of the 3D geometry processor of the CUBE Architecture, which is a voxel-based system for 3D graphics. These algorithms allow the' CUBE system to generate the essential primitive polygon within the CFB from a 3D geometric model.