An efficient 3-D visualization technique for finite element models and other coarse volumes
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Footprint evaluation for volume rendering
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Area and volume coherence for efficient visualization of 3D scalar functions
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Raytracing irregular volume data
VVS '90 Proceedings of the 1990 workshop on Volume visualization
A polygonal approximation to direct scalar volume rendering
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Hierarchical splatting: a progressive refinement algorithm for volume rendering
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
A data distributed, parallel algorithm for ray-traced volume rendering
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Eliminating popping artifacts in sheet buffer-based splatting
Proceedings of the conference on Visualization '98
Multiresolution techniques for interactive texture-based volume visualization
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
VVS '89 Proceedings of the 1989 Chapel Hill workshop on Volume visualization
On-the-Fly rendering of losslessly compressed irregular volume data
Proceedings of the conference on Visualization '00
Multiresolution view-dependent splat based volume rendering of large irregular data
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
An out-of-core method for computing connectivities of large unstructured meshes
EGPGV '02 Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization
Proceedings of the conference on Visualization '01
TetFusion: an algorithm for rapid tetrahedral mesh simplification
Proceedings of the conference on Visualization '02
Optical Models for Direct Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
Multiresolution Representation and Visualization of Volume Data
IEEE Transactions on Visualization and Computer Graphics
Out-of-Core Streamline Visualization on Large Unstructured Meshes
IEEE Transactions on Visualization and Computer Graphics
Simplification of Tetrahedral Meshes with Error Bounds
IEEE Transactions on Visualization and Computer Graphics
Parallel Volume Rendering on a Network of Workstations
IEEE Computer Graphics and Applications
Feature preserved volume simplification
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Fast Algorithms for Visualizing Fluid Motion in Steady Flow on Unstructured Grids
VIS '95 Proceedings of the 6th conference on Visualization '95
Simplification of Tetrahedral Meshes with Accurate Error Evaluation
VISUALIZATION '00 Proceedings of the 11th IEEE Visualization 2000 Conference (VIS 2000)
Interactive splatting of nonrectilinear volumes
VIS '92 Proceedings of the 3rd conference on Visualization '92
Texture splats for 3D scalar and vector field visualization
VIS '93 Proceedings of the 4th conference on Visualization '93
| Hi-index | 0.00 |
In this article, a new multiple resolution volume rendering method for Finite Element Analysis (FEA) data is presented. Our method is composed of three stages: At the first stage, the Gauss points of the FEA cells are calculated. The function values, gradients, diffusions, and influence scopes of the Gauss points are computed. By representing the Gauss points as graph vertices and connecting adjacent Gauss points with edges, an adjacency graph is created. The adjacency graph is used to represent the FEA data in the subsequent computation. At the second stage, a hierarchical structure is established upon the adjacency graph. Any two neighboring vertices with similar function values are merged into a new vertex. The similarity is measured by using a user-defined threshold. Consequently a new adjacency graph is constructed. Then the threshold is increased, and the graph reduction is triggered again to generate another adjacency graph. By repeating the processing, multiple adjacency graphs are computed, and a Level of Detail (LoD) representation of the FEA data is established. At the third stage, the LoD structure is rendered by using a splatting method. At first, a level of adjacency graph is selected by users. The graph vertices are sorted based on their visibility orders and projected onto the image plane in back-to-front order. Billboards are used to render the vertices in the projection. The function values, gradients, and influence scopes of the vertices are utilized to decide the colors, opacities, orientations, and shapes of the billboards. The billboards are then modulated with texture maps to generate the footprints of the vertices. Finally, these footprints are composited to produce the volume rendering image.