Simplifying Flexible Isosurfaces Using Local Geometric Measures
VIS '04 Proceedings of the conference on Visualization '04
Topology-Controlled Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
Topological Landscapes: A Terrain Metaphor for Scientific Data
IEEE Transactions on Visualization and Computer Graphics
Reeb graphs for shape analysis and applications
Theoretical Computer Science
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
I/O-Efficient Contour Tree Simplification
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
Description of digital images by region-based contour trees
ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Tessellation of quadratic elements
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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.