Volume thinning for automatic isosurface propagation
Volume thinning for automatic isosurface propagation
复制标题
自动等值面传播的体积细化
DOI：
10.1109/visual.1996.568123
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
K. Koyamada
中科院分区：
文献类型：
--
作者：
T. Itoh;Yasushi Yamaguchi;K. Koyamada
通过按顺序访问相邻的相交单元可以有效地生成等值面，就好像等值面正在自行传播一样。我们之前提出了一种极值图方法（T. Itoh 和 K. Koyamada，1995），它生成连接极值点的图。等值面传播从一些相交的单元开始，这些相交的单元通过访问图形的弧经过的单元和访问体积边界上的单元来找到。我们提出了一种搜索等值面相交单元的有效方法。该方法生成体积骨架。通过应用图像识别领域中使用的细化算法，由单元组成，如极值图。由于它保留了体积的拓扑特征和极值点的连通性，因此它必然与每个等值面相交。该方法比极值图方法更有效，因为它不需要访问边界上的单元。
An isosurface can be efficiently generated by visiting adjacent intersected cells in order, as if the isosurface were propagating itself. We previously proposed an extrema graph method (T. Itoh and K. Koyamada, 1995), which generates a graph connecting extremum points. The isosurface propagation starts from some of the intersected cells that are found both by visiting the cells through which arcs of the graph pass and by visiting the cells on the boundary of a volume. We propose an efficient method of searching for cells intersected by an isosurface. This method generates a volumetric skeleton. consisting of cells, like an extrema graph, by applying a thinning algorithm used in the image recognition area. Since it preserves the topological features of the volume and the connectivity of the extremum points, it necessarily intersects every isosurface. The method is more efficient than the extrema graph method, since it does not require that cells on the boundary be visited.