Proceedings of the 9th annual ACM symposium on User interface software and technology
Generation of transfer functions with stochastic search techniques
Proceedings of the 7th conference on Visualization '96
Design galleries: a general approach to setting parameters for computer graphics and animation
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
VIS '97 Proceedings of the 8th conference on Visualization '97
Semi-automatic generation of transfer functions for direct volume rendering
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Image-based transfer function design for data exploration in volume visualization
Proceedings of the conference on Visualization '98
Two-handed virtual manipulation
ACM Transactions on Computer-Human Interaction (TOCHI)
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
AFRIGRAPH '01 Proceedings of the 1st international conference on Computer graphics, virtual reality and visualisation
Automatic Isosurface Propagation Using an Extrema Graph and Sorted Boundary Cell Lists
IEEE Transactions on Visualization and Computer Graphics
Fast Isosurface Generation Using the Volume Thinning Algorithm
IEEE Transactions on Visualization and Computer Graphics
The Transfer Function Bake-Off
IEEE Computer Graphics and Applications
Computing contour trees in all dimensions
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Antiproton-Hydrogen Atom Collision at Intermediate Energy
Computing in Science and Engineering
Designing effective step-by-step assembly instructions
ACM SIGGRAPH 2003 Papers
Volumetric illustration: designing 3D models with internal textures
ACM SIGGRAPH 2004 Papers
SG '09 Proceedings of the 10th International Symposium on Smart Graphics
Hi-index | 0.00 |
Cross-sectioning is a popular method for visualizing the complicated inner structures of three-dimensional volume datasets. However, the process is usually manual, meaning that a user must manually specify the cross-section's location using a repeated trial-and-error process. To find the best cross-sections, this method requires that a user is knowledgeable and experienced. This paper proposes a method for automatically generating characteristic cross-sections from a given volume dataset. The application of a volume skeleton tree (VST), which is a graph that delineates the topological structure of a three-dimensional volume, facilitates the automated generation of cross-sections giving good representations of the topological characteristics of a dataset. The feasibility of the proposed method is demonstrated using several examples.