 |
 |
|
Volume Graphics A. Kaufman, D. Cohen and R. Yagel, IEEE Computer, Vol. 26, No. 7, July 1993, pp. 51-64. Also in Japanese, Nikkei Computer Graphics, 1, No. 88, 148-155 & 2, No. 89, 130-137, 1994. |
|
|
|
3D Active Net for Volume Extraction (submitted for publication) Written by Ikuko Takanahi, Shigeru Muraki, Akio Doi, Arie Kaufman. |
|
|
|
Volume Terrain Modeling and Rendering for Flight Simulation
Abstract: We present a non-traditional approach for flight simulation and training, mission planning and rehearsal. It involves photo-realistic volume-based modeling and rendering of real world terrains from a single elevation map and a satellite or aerial photograph of the terrain. This has been achieved using voxelization, 3D texture splatting and ray-casting. We demonstrate the ability of our approach to create photo-realistic renderings of terrains from any viewpoint.
|
|
|
|
Volume Terrain Modeling and Rendering for Visual Flythrough
Abstract: This report describes the different algorithms implemented as part of the Visual Flythrough project. The main emphasis has been to implement algorithms for realistic render ing of volumetric terrain. Functions have been implemented for handling various input data formats. A simple voxelization scheme has been implemented for generation of anti-aliased voxel terrain models. VolVis has been extended to support terrain models using a scene graph. Fast modeling and rendering has been achieved by using multiple CPUs on the system. Several sample terrains have been rendered to validate the utility of this scheme. |
|
|
|
Performance of Parallel Volume Graphics Algorithms on
SGI Power Challenge
Abstract: The shared-memory multiprocessor system has recently attracted a lot of attention because of its low cost and wide availability to the graphics researchers. In this paper, we show practical parallel solutions to the following volume graphics problems: volume texture modeling, volume texture rendering, and voxelization for unstructured grid rendering. All these solutions process 2D and 3D arrays and employ multiple processors on the shared-memory system. We present results for parallel execution time, parallel memory requirement and overheads for the three algorithms described in this work. We also present results of performance prediction based on both analytical and experimental results. |
|
|