No abstract available.
Volume probes: interactive data exploration on arbitrary grids
A taxonomy of computational grids used in scientific and engineering practice is presented and a technique for cutting them by, and displaying data on, 2D surfaces is developed. When sliced by a surface, these grids give rise to a graph G(C, F) where C, ...
3D modeling using an extended cell enumeration representation
3D imaging offers the opportunity to gather new kinds of information for diagnosis and therapy. In order to access this information efficiently we need a model for the integration of knowledge which is extracted from the images. In this paper we present ...
Volume rendering and data feature enhancement
This paper describes a general visualization model for 3D scalar data fields based on linear transport theory which contains common volume rendering models as special cases and/or approximations. The concept of "virtual" particles for the extraction of ...
Area and volume coherence for efficient visualization of 3D scalar functions
We present an algorithm for compositing a combination of density clouds and contour surfaces used to represent a scalar function on a 3-D volume subdivided into convex polyhedra. The scalar function is interpolated between values defined at the vertices,...
Raytracing irregular volume data
An efficient technique is described for rendering volume data which is not organized as a regular, three-dimensional grid. The algorithm works on collections of convex cells with shared faces. Datasets of this form are quite common in such applications ...
Direct volume rendering of curvilinear volumes
Direct volume rendering can visualize sampled 3D scalar data as a continuous medium or extract features. However, it is generally slow. Furthermore, most algorithms for direct volume rendering have assumed rectilinear gridded data. This paper discusses ...
A decomposition algorithm for visualizing irregular grids
Few methods exist for visualizing scientific data on irregular grids. An important reason is the lack of an efficient method of point location on such grids. An algorithm is presented to address this problem. On d-dimensional grids of n irregularly ...
A polygonal approximation to direct scalar volume rendering
One method of directly rendering a three-dimensional volume of scalar data is to project each cell in a volume onto the screen. Rasterizing a volume cell is more complex than rasterizing a polygon. A method is presented that approximates tetrahedral ...
Three-pass affine transforms for volume rendering
Affine transformations of volume arrays are important for implementing volume modeling and orthographic viewing transformations and for registering multiple data sets. In this paper we extend the two-pass algorithm for affine image transformations to a ...
Rendering volumetric data using STICKS representation scheme
An increasing need to efficiently represent and render 3D volumetric data is being experienced in many application fields ranging from scientific and medical visualization to CAD. A technique of representing this kind of data, the Sticks representation ...
An efficient method for volume rendering using perspective projection
Use of the perspective projection adds important perceptual cues for image comprehension. However, it has not been widely used in volume rendering because of the lack of efficient computational algorithms and concern over the nonuniform sampling rate ...
Index Terms
Proceedings of the 1990 workshop on Volume visualization



