期刊文献+

拓扑结构正确的三线性插值曲面的三角片逼近 被引量:9

A Topology Complexity Based Method to Approximate Isosurface with Trilinear Interpolated Triangular Patch
下载PDF
导出
摘要 在等值面的三角片逼近问题中,采样点的选择对于逼近等值面拓扑结构的正确性和逼近的精确性都非常关键.现有的Marching Cubes以及对其进行改进的方法缺乏对原始曲面拓扑结构的考虑,通常选择同类采样点,无法保证逼近等值面具有正确的拓扑结构.为解决上述问题,将Morse理论的基本思想引入到等值面逼近问题中,提出基于拓扑复杂度的等值面逼近的新方法.该方法根据体元内部曲面拓扑复杂度不同,自适应地提取两类等值点作为采样点临界点和边界等值点.由于临界点是反映曲面拓扑结构的关键点,因此,无论原始曲面的拓扑结构复杂与否,新方法都能保证逼近等值面具有正确的拓扑结构、较高的逼近精度且基本不增加计算量和数据量.用实例对新方法和已有方法的逼近结果做了比较. To approximate isosurface with triangular patch, the selection of sample points is pivotal to the topology correctness and approximation accuracy. In the marching cubes method and its variations, the topology of original surface is not taken into account, and only the same kind of isopoints is selected, and thus these methods can't guarantee correct topology of approximated isosurface. In this paper, Morse theory is incorporated into the study of triangular approximation, and a new method based on topology complexity is presented to approximate the isosurface patch inside a cell. According to the topology complexity of the original isosurface, the approximated isosurfaces can be adaptively constructed by triangulating two kinds of isopoints: critical points and the isopoints on cell edges. Because critical points are the key isopoints defining the surface topology, the new method can guarantee correct topology and high accuracy of the approximated isosurface without adding much computation and data. Examples are given for comparing the approximated isosurface generated from the new method with those from other methods.
出处 《计算机研究与发展》 EI CSCD 北大核心 2006年第3期528-535,共8页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60403036) 教育部博士点基金项目(20020422030)~~
关键词 等值面 逼近 拓扑 复杂度 临界点 isosurface approximation topology complexity Critical point
  • 相关文献

参考文献17

  • 1H. Hoppe, T. DeRose, T. Duchanap, et al. Surface reconstruction from unorganized points. Computer Graphics,1992, 26(2): 71-78.
  • 2B, Curless, M, Levoy, A volumetric method for building complex models from range images, ACM Computer Graphics,SIGGRAPH1996, New Orleans, 1996.
  • 3T. W, Sederberg, E, Greenwood, A physically based approach to 2D shape blending. Computer Graphics, 1992, 26(2) : 25 - 34.
  • 4D. E, Breen, R. T, Whitaker. A level-set approach for the metamorphosis of solid models, IEEE Trans, Visualization and Computer Graphics, 2001, 7(2) : 173-192.
  • 5W. E. Lorensen, H. E. Cline. Marching cubes: A high resolution 3D surface construction algorithm. Computer Graphics,1987. 21(4): 163-169.
  • 6S. Bischoff, L. Kobbelt. lsosurface reconstruction with topology control. The 10th Pacific Conf. Computer Graphics and Applications, Beijing, 2002.
  • 7M. Duurst. Additional reference to marching cubes. Computer Graphics, 1988, 22(2): 72-73.
  • 8G. M. Nielson, B. Hamann. The asymptotic decider: Resolving the ambiguity in marching cubes. In: Prec. IEEE Visualization' 91 Conf. Los Alamitos, CA: IEEE Computer Society Press, 1991.83-91.
  • 9E. V. Chernyaev. Marching cubes 33: Construction of topologically correct isosurface. CERN, Geneva, Tech. Rep. :CN/95-17, 1995.
  • 10P. Cignoni, F. Ganovelli, C. Montani, et al. Reconstruction of topologically correct and adaptive trilinear surfaces. Computers and Graphics, 2000, 24(3): 399-418.

同被引文献86

引证文献9

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部