Re-meshing techniques for topological analysis

被引：13

作者：

Attene, M ^{[1
]}

Biasotti, S ^{[1
]}

Spagnuolo, M ^{[1
]}

机构：

[1] CNR, Ist Matemat Appl, Rome, Italy

来源：

INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDING | 2001年

关键词：

D O I：

10.1109/SMA.2001.923385

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A method for the extraction of the Extended Reeb Graph (ERG) from a closed 3D triangular mesh is presented. The ERG codes the relationships among critical points of the height function associated to the mesh, and it can represent isolated as well as degenerate critical points. The extraction process is based on a remeshing strategy of the original mesh, which is forced to follow contour levels. The occurrence and configuration of flat areas in the re-triangulated model identify critical areas of the shape, and their relationships allow the reconstruction of the global topological structure of the shape.

引用

页码：142 / +

页数：11

共 29 条

[1] AUTOMATIC DERIVATION OF SKELETON LINES FROM DIGITIZED CONTOURS [J].

AUMANN, G ;

EBNER, H ;

TANG, L .

ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING, 1991, 46 (05) :259-268

[2]

AXEN U, 1998, MATH VISUALIZATION, P223

[3] Topology preserving data simplification with error bounds [J].

Bajaj, CL ;

Schikore, DR .

COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :3-12

[4]

BAJAJ CL, 1996, SPIE S, P39

[5] CRITICAL POINTS AND CURVATURE FOR EMBEDDED POLYHEDRAL SURFACES [J].

BANCHOFF, TF .

AMERICAN MATHEMATICAL MONTHLY, 1970, 77 (05) :475-&

[6] On triangulating three-dimensional polygons [J].

Barequet, G ;

Dickerson, M ;

Eppstein, D .

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 10 (03) :155-170

[7]

BIASOTTI S, 2000, SPRING C COMP GRAPH, P174

[8]

BIASOTTI S, 2000, P 6 WORKSH GEO 7 PAR

[9]

BIASOTTI S, 2000, LCNS

[10] A comparison of mesh simplification algorithm [J].

Cignoni, P ;

Montani, C ;

Scopigno, R .

COMPUTERS & GRAPHICS-UK, 1998, 22 (01) :37-54

← 1 2 3 →