- Author:
- Hamish Carr,
- Adviser:
- Michiel Van Panne
In this thesis, I show how to use the topological information encoded manipulation of individual contour surfaces in an isosurface scene, using an interface called the flexible isosurface. Underpinning this interface are several improvements and extensions to existing work on the contour tree. The first, and most critical, extension, is the path seed: a new method of generating seeds from the contour tree for isosurface extraction. The second extension is to compute geometric information called local spatial measures for contours and store this information in the contour tree. The third extension is to use local spatial measures to simplify both the contour tree and isosurface displays. This simplification can also be used for noise removal. Lastly, this thesis extends work with contour trees from simplicial meshes to arbitrary meshes, interpolants, and tessellation cases.
Cited By
- Saikia H and Weinkauf T (2017). Global Feature Tracking and Similarity Estimation in Time-Dependent Scalar Fields, Computer Graphics Forum, 36:3, (1-11), Online publication date: 1-Jun-2017.
- Wang C and Tao J (2017). Graphs in Scientific Visualization, Computer Graphics Forum, 36:1, (263-287), Online publication date: 1-Jan-2017.
Thomas D, Borgo R, Laramee R and Hands S QCDVis Proceedings of the 33rd Spring Conference on Computer Graphics, (1-14)- Saikia H, Seidel H and Weinkauf T Extended branch decomposition graphs Proceedings of the 16th Eurographics Conference on Visualization, (41-50)
- Harvey W, Wang Y and Wenger R A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes Proceedings of the twenty-sixth annual symposium on Computational geometry, (267-276)
- Arge L and Revsbæk M I/O-Efficient Contour Tree Simplification Proceedings of the 20th International Symposium on Algorithms and Computation, (1155-1165)
- Biasotti S, De Floriani L, Falcidieno B, Frosini P, Giorgi D, Landi C, Papaleo L and Spagnuolo M (2008). Describing shapes by geometrical-topological properties of real functions, ACM Computing Surveys (CSUR), 40:4, (1-87), Online publication date: 1-Oct-2008.
- Biasotti S, Giorgi D, Spagnuolo M and Falcidieno B (2008). Reeb graphs for shape analysis and applications, Theoretical Computer Science, 392:1-3, (5-22), Online publication date: 20-Feb-2008.
- Weber G, Dillard S, Carr H, Pascucci V and Hamann B (2007). Topology-Controlled Volume Rendering, IEEE Transactions on Visualization and Computer Graphics, 13:2, (330-341), Online publication date: 1-Mar-2007.
- Weber G, Bremer P and Pascucci V (2007). Topological Landscapes, IEEE Transactions on Visualization and Computer Graphics, 13:6, (1416-1423), Online publication date: 1-Nov-2007.
- Dillard S, Natarajan V, Weber G, Pascucci V and Hamann B Tessellation of quadratic elements Proceedings of the 17th international conference on Algorithms and Computation, (722-731)
- Mizuta S and Matsuda T Description of digital images by region-based contour trees Proceedings of the Second international conference on Image Analysis and Recognition, (549-558)
- Carr H, Snoeyink J and van de Panne M Simplifying Flexible Isosurfaces Using Local Geometric Measures Proceedings of the conference on Visualization '04, (497-504)
Index Terms
- Topological manipulation of isosurfaces
Recommendations
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 ...
Delaunay Meshing of Isosurfaces
SMI '07: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007We 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 ...
Topological simplification of isosurfaces in volumetric data using octrees
Volumetric data, such as output from CT scans or laser range scan processing methods, often have isosurfaces that contain topological noise-small handles and holes that are not present in the original model. Because this noise can significantly degrade ...