Article

Simplifying Flexible Isosurfaces Using Local Geometric Measures

Authors:

Michiel van de PanneAuthors Info & Claims

VIS '04: Proceedings of the conference on Visualization '04

Pages 497 - 504

https://doi.org/10.1109/VISUAL.2004.96

Published: 10 October 2004 Publication History

Abstract

The contour tree, an abstraction of a scalar field that encodes the nesting relationships of isosurfaces, can be used to accelerate isosurface extraction, to identify important isovalues for volume-rendering transfer functions, and to guide exploratory visualization through a flexible isosurface interface. Many real-world data sets produce unmanageably large contour trees which require meaningful simplification. We define local geometric measures for individual contours, such as surface area and contained volume, and provide an algorithm to compute these measures in a contour tree. We then use these geometric measures to simplify the contour trees, suppressing minor topological features of the data. We combine this with a flexible isosurface interface to allow users to explore individual contours of a dataset interactively.

References

[1]

BAJAJ, C. L., PASCUCCI, V., AND SCHIKORE, D. R. 1997. The Contour Spectrum. In Proceedings of IEEE Visualization 1997, 167-173.

Digital Library

[2]

BENTLEY, J. L. 1979. Decomposable searching problems. Inform. Process. Lett. 8, 244-251.

[3]

BREMER, P.-T., EDELSBRUNNER, H., HAMANN, B., AND PASCUCCI, V. 2003. A Multi-resolution Data Structure for Two-dimensional Morse-Smale Functions. In Proceedings of IEEE Visualization 2003, 139-146.

Digital Library

[4]

BRODLIE, K., AND WOOD, J. 2001. Recent advances in volume visualization. Computer Graphics Forum 20, 2 (June), 125-148.

[5]

CARR, H., AND SNOEYINK, J. 2003. Path Seeds and Flexible Isosurfaces: Using Topology for Exploratory Visualization. In Proceedings of Eurographics Visualization Symposium 2003, 49-58, 285.

Digital Library

[6]

CARR, H., MÖLLER, T., AND SNOEYINK, J. 2001. Simplicial Subdivisions and Sampling Artifacts. In Proceedings of IEEE Visualization 2001, 99-106.

Digital Library

[7]

CARR, H., SNOEYINK, J., AND AXEN, U. 2003. Computing Contour Trees in All Dimensions. Computational Geometry: Theory and Applications 24, 2, 75-94.

Digital Library

[8]

CARR, H. 2004. Topological Manipulation of Isosurfaces. PhD thesis, University of British Columbia, Vancouver, BC, Canada.

Digital Library

[9]

CHIANG, Y.-J., AND LU, X. 2003. Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies. Computer Graphics Forum 22, 3, to appear.

[10]

CHIANG, Y.-J., LENZ, T., LU, X., AND ROTE, G. 2002. Simple and Output-Sensitive Construction of Contour Trees Using Monotone Paths. Tech. Rep. ECGTR-244300-01, Institut für Informatik, Freie Universtät Berlin.

[11]

EDELSBRUNNER, H., AND MÜCKE, E. P. 1990. Simulation of Simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9, 1, 66-104.

Digital Library

[12]

EDELSBRUNNER, H., LETSCHER, D., AND ZOMORODIAN, A. 2002. Topological persistence and simplification. Discrete Comput. Geom. 28, 511-533.

Digital Library

[13]

EDELSBRUNNER, H., HARER, J., AND ZOMORODIAN, A. 2003. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete Comput. Geom. 30, 87-107.

[14]

HILAGA, M., SHINAGAWA, Y., KOHMURA, T., AND KUNII, T. L. 2001. Topology matching for fully automatic similarity estimation of 3d shapes. In SIGGRAPH 2001, 203-212.

Digital Library

[15]

KETTNER, L., ROSSIGNAC, J., AND SNOEYINK, J. 2001. The Safari Interface for Visualizing Time-Dependent Volume Data Using Iso-surfaces and Contour Spectra. Computational Geometry: Theory and Applications 25, 1-2, 97-116.

Digital Library

[16]

LORENSON, W. E., AND CLINE, H. E. 1987. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics 21, 4, 163-169.

Digital Library

[17]

MATSUMOTO, Y. 2002. An Introduction to Morse Theory. AMS.

[18]

MILNOR, J. 1963. Morse Theory. Princeton University Press, Princeton, NJ.

[19]

MONTANI, C., SCATENI, R., AND SCOPIGNO, R. 1994. A modified look-up table for implicit disambiguation of Marching Cubes. Visual Computer 10, 353-355.

[20]

PASCUCCI, V., AND COLE-MCLAUGHLIN, K. 2002. Efficient Computation of the Topology of Level Sets. In Proceedings of IEEE Visualization 2002, 187-194.

Digital Library

[21]

PASCUCCI, V. 2001. On the Topology of the Level Sets of a Scalar Field. In Abstracts of the 13th Canadian Conference on Computational Geometry, 141-144.

[22]

REEB, G. 1946. Sur les points singuliers d'une forme de Pfaff complètement intégrable ou d'une fonction numérique. Comptes Rendus de l'Acadèmie des Sciences de Paris 222, 847-849.

[23]

TAKAHASHI, S., FUJISHIRO, I., AND TAKESHIMA, Y. 2004. Topological volume skeletonization and its application to transfer function design. Graphical Models 66, 1, 24-49.

Digital Library

[24]

TAKAHASHI, S., NIELSON, G. M., TAKESHIMA, Y., AND FUJISHIRO, I. 2004. Topological Volume Skeletonization Using Adaptive Tetrahedralization. In Geometric Modelling and Processing 2004.

Digital Library

[25]

TARASOV, S. P., AND VYALYI, M. N. 1998. Construction of Contour Trees in 3D in O(nlogn) steps. In Proceedings of the 14th ACM Symposium on Computational Geometry, 68-75.

Digital Library

[26]

VAN KREVELD, M., VAN OOSTRUM, R., BAJAJ, C. L., PASCUCCI, V., AND SCHIKORE, D. R. 1997. Contour Trees and Small Seed Sets for Isosurface Traversal. In Proceedings of the 13th ACM Symposium on Computational Geometry, 212-220.

Digital Library

Cited By

Papamarkou TBirdal TBronstein MCarlsson GCurry JGao YHajij MKwitt RLiò PDi Lorenzo PMaroulas VMiolane NNasrin FRamamurthy KRieck BScardapane SSchaub MVeličković PWang BWang YWei GZamzmi GSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)PositionProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3693671(39529-39555)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3693671
Guardieiro Vde Oliveira FDoraiswamy HNonato LSilva C(2024)TopoMap++: A Faster and More Space Efficient Technique to Compute Projections with Topological GuaranteesIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345636531:1(229-239)Online publication date: 10-Sep-2024
https://dl.acm.org/doi/10.1109/TVCG.2024.3456365
Finken TTierny JLevine J(2024)Localized Evaluation for Constructing Discrete Vector FieldsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345635531:1(86-96)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1109/TVCG.2024.3456355
Show More Cited By

Simplifying Flexible Isosurfaces Using Local Geometric Measures
1. Computing methodologies
  1. Computer graphics

Recommendations

Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree

The contour tree is an abstraction of a scalar field that encodes the nesting relationships of isosurfaces. We show how to use the contour tree to represent individual contours of a scalar field, how to simplify both the contour tree and the topology of ...
Delaunay meshing of isosurfaces

We present an isosurface meshing algorithm, DelIso, based on the Delaunay refinement paradigm. This paradigm has been successfully applied to mesh a variety of domains with guarantees for topology, geometry, mesh gradedness, and triangle shape. A ...
Efficient representation and extraction of 2-manifold isosurfaces using kd-trees
Special issue on pacific graphics 2003

In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in terms of adaptation to the object surface. In consequence, we obtain ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

VIS '04: Proceedings of the conference on Visualization '04

October 2004

667 pages

ISBN:0780387880

Sponsors

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

IEEE Computer Society

United States

Publication History

Published: 10 October 2004

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
16
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Papamarkou TBirdal TBronstein MCarlsson GCurry JGao YHajij MKwitt RLiò PDi Lorenzo PMaroulas VMiolane NNasrin FRamamurthy KRieck BScardapane SSchaub MVeličković PWang BWang YWei GZamzmi GSalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)PositionProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3693671(39529-39555)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3693671
Guardieiro Vde Oliveira FDoraiswamy HNonato LSilva C(2024)TopoMap++: A Faster and More Space Efficient Technique to Compute Projections with Topological GuaranteesIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345636531:1(229-239)Online publication date: 10-Sep-2024
https://dl.acm.org/doi/10.1109/TVCG.2024.3456365
Finken TTierny JLevine J(2024)Localized Evaluation for Constructing Discrete Vector FieldsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345635531:1(86-96)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1109/TVCG.2024.3456355
Kissi MPont MLevine JTierny J(2024)A Practical Solver for Scalar Data Topological SimplificationIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345634531:1(97-107)Online publication date: 10-Sep-2024
https://dl.acm.org/doi/10.1109/TVCG.2024.3456345
Wang CTao J(2017)Graphs in Scientific VisualizationComputer Graphics Forum10.1111/cgf.1280036:1(263-287)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1111/cgf.12800
Patan G(2017)Mesh-based and meshless design and approximation of scalar functionsComputer Aided Geometric Design10.1016/j.cagd.2017.05.00557:C(23-43)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1016/j.cagd.2017.05.005
Zhang GKochunov PHong ECarr HChen JBertini EElmqvist NWischgoll T(2016)Towards visual mega-analysis of voxel-based measurement in brain cohortsProceedings of the Eurographics / IEEE VGTC Conference on Visualization: Short Papers10.5555/3058878.3058890(55-59)Online publication date: 6-Jun-2016
https://dl.acm.org/doi/10.5555/3058878.3058890
Thomas DBorgo RHands STurkay CWan T(2016)Topological visualisation techniques for the understanding of lattice quantum chromodynamics (LQCD) simulationsProceedings of the conferece on Computer Graphics & Visual Computing10.5555/3056482.3056496(65-72)Online publication date: 15-Sep-2016
https://dl.acm.org/doi/10.5555/3056482.3056496
Wang CJiang HDong Y(2016)Connectivity-Based Space Filling Curve Construction Algorithms in High Genus 3D Surface WSNsACM Transactions on Sensor Networks10.1145/290794712:3(1-29)Online publication date: 12-Aug-2016
https://dl.acm.org/doi/10.1145/2907947
Chattopadhyay ACarr HDuke DGeng ZSaeki O(2016)Multivariate topology simplificationComputational Geometry: Theory and Applications10.1016/j.comgeo.2016.05.00658:C(1-24)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1016/j.comgeo.2016.05.006
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten