Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
Shape transformation for polyhedral objects
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
VIS '97 Proceedings of the 8th conference on Visualization '97
Fast detection of meaningful isosurfaces for volume data visualization
Proceedings of the conference on Visualization '01
Salient iso-surface detection with model-independent statistical signatures
Proceedings of the conference on Visualization '01
A Level-Set Approach for the Metamorphosis of Solid Models
IEEE Transactions on Visualization and Computer Graphics
Computing contour trees in all dimensions
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Simplifying Flexible Isosurfaces Using Local Geometric Measures
VIS '04 Proceedings of the conference on Visualization '04
Shape Registration in Implicit Spaces Using Information Theory and Free Form Deformations
IEEE Transactions on Pattern Analysis and Machine Intelligence
On Histograms and Isosurface Statistics
IEEE Transactions on Visualization and Computer Graphics
Stability and convergence of the level set method in computer vision
Pattern Recognition Letters
Revisiting Histograms and Isosurface Statistics
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics
On the Fractal Dimension of Isosurfaces
IEEE Transactions on Visualization and Computer Graphics
Integrating Isosurface Statistics and Histograms
IEEE Transactions on Visualization and Computer Graphics
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Hi-index | 0.00 |
While isosurfaces have been widely used for scalar data visualization, it is often difficult to determine if the selected isosurfaces for visualization are sufficient to represent the entire scalar field. In this paper, we present an information-theoretic approach to evaluate the representativeness of a given isosurface set. Our basic idea is that given two isosurfaces that enclose a subvolume, if the intermediate isosurfaces in the subvolume can be generated by smoothly morphing from one isosurface to the other, no additional isosurfaces are needed since the geometry of the true isosurfaces within the subvolume can be easily inferred. To realize this idea, given a pair of isosurfaces, to determine if such a smooth condition in the enclosed region is satisfied, we use a level-set approach to generate the intermediate surfaces. On each intermediate surface, we sample the values from the scalar field and exam the distribution. If the entropy of the distribution is low, this intermediate surface is aligned well with a true isosurface in the scalar field. For the intermediate surfaces generated by the level-set method from the boundary isosurfaces, the distributions of scalar values from the level-set surfaces form a 2D distribution, called isosurface information map. This information map can be used as an indicator of the representativeness of the boundary isosurfaces for the data in the subregion, allowing a quantitative measurement of information representable by the input isosurfaces. Based on this information-theoretic approach, this paper presents an isosurface selection algorithm that can automatically select isosurfaces for more effective visualization of scalar fields.