Representing Interpolant Topology for Contour Tree Computation
Representing Interpolant Topology for Contour Tree Computation
复制标题
表示轮廓树计算的插值拓扑
DOI：
10.1007/978-3-540-88606-8_5
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
J. Snoeyink
中科院分区：
文献类型：
--
作者：
Hamish A. Carr;J. Snoeyink
用于计算可视化轮廓树的算法通常假设输入是通过单纯网格上的重心插值或立方网格上的三线性插值来定义的。在本文中，我们描述了从捕获所有重要拓扑特征的图中计算轮廓树的通用框架。我们展示了如何使用逐个单元的“小部件”从任何基于网格的插值构建这些图，以及如何通过制作捕获其遍历的有限状态机来避免构建整个图。
Algorithms for computing contour trees for visualization commonly assume that the input is defined by barycentric interpolation on simplicial meshes or by trilinear interpolation on cubic meshes. In this paper, we describe a general framework for computing contour trees from a graph that captures all significant topological features. We show how to construct these graphs from any mesh-based interpolant by using cell-by-cell “widgets,” and also how to avoid constructing the entire graphs by making finite state machines that capture their traversals.