Regularised marching tetrahedra: improved iso-surface extraction

被引:239
作者
Treece, GM [1 ]
Prager, RW [1 ]
Gee, AH [1 ]
机构
[1] Univ Cambridge, Dept Engn, Cambridge CB2 1PZ, England
来源
COMPUTERS & GRAPHICS-UK | 1999年 / 23卷 / 04期
基金
英国工程与自然科学研究理事会;
关键词
iso-surface extraction; marching cubes; marching tetrahedra; vertex clustering; mesh simplification;
D O I
10.1016/S0097-8493(99)00076-X
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Marching cubes is a simple and popular method for extracting iso-surfaces from implicit functions or discrete three-dimensional (3-D) data. However, it does not guarantee the surface to be topologically consistent with the data, and it creates triangulations which contain many triangles of poor aspect ratio. Marching tetrahedra is a variation of marching cubes, which overcomes this topological problem, but further degrades the triangle aspect ratios. Improvement in triangle aspect ratio has generally been achieved by mesh simplification, a group of algorithms designed mainly to reduce the triangle count. Vertex clustering is one of the simplest, but does not necessarily maintain the topology of the original mesh. We present a new algorithm, regularised marching tetrahedra (RMT), which combines marching tetrahedra and vertex clustering to generate iso-surfaces which are topologically consistent with the data and contain a number of triangles appropriate to the sampling resolution (typically 70% fewer than marching tetrahedra) with significantly improved aspect ratios. This improvement in aspect ratio greatly enhances smooth shaded displays of the surface. Surface triangulations are shown for implicit surfaces, thresholded medical data, and surfaces created from object cross-sections - implementations of RMT appropriate to each of these situations are available.(1) The application to data sampled on non-parallel planes is also considered. (C) 1999 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:583 / 598
页数:16
相关论文
共 27 条
[1]  
Algorri ME, 1996, COMPUT GRAPH FORUM, V15, pC77, DOI 10.1111/1467-8659.1530077
[2]   A new tetrahedral tesselation scheme for isosurface generation [J].
Chan, SL ;
Purisima, EO .
COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :83-90
[3]   A comparison of mesh simplification algorithm [J].
Cignoni, P ;
Montani, C ;
Scopigno, R .
COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :37-54
[4]  
FOLEY JD, 1996, ADDISONWESLEY SYSTEM
[5]  
Garland M., 1997, Computer Graphics Proceedings, SIGGRAPH 97, P209, DOI 10.1145/258734.258849
[6]   Exploiting triangulated surface extraction using tetrahedral decomposition [J].
Gueziec, A ;
Hummel, R .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1995, 1 (04) :328-342
[7]  
GUEZIEC A, 1994, P SOC PHOTO-OPT INS, V2359, P631
[8]   ADAPTIVE POLYGONALIZATION OF IMPLICITLY DEFINED SURFACES [J].
HALL, M ;
WARREN, J .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1990, 10 (06) :33-40
[9]   A marching method for the triangulation of surfaces [J].
Hartmann, E .
VISUAL COMPUTER, 1998, 14 (03) :95-108
[10]   SHAPE-BASED INTERPOLATION [J].
HERMAN, GT ;
ZHENG, JS ;
BUCHOLTZ, CA .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1992, 12 (03) :69-79