High quality compatible triangulations

被引:41
作者
Surazhsky, V [1 ]
Gotsman, C
机构
[1] Univ Oslo, Dept Informat, N-0316 Oslo, Norway
[2] Technion Israel Inst Technol, Dept Comp Sci, Ctr Graph & Geometr Comp, IL-32000 Haifa, Israel
关键词
compatible triangulations; low discrepancy point sets; morphing; remeshing; sweep meshes;
D O I
10.1007/s00366-004-0282-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 [计算机应用技术]; 0835 [软件工程];
摘要
Compatible meshes are isomorphic meshings of the interiors of two polygons having a correspondence between their vertices. Compatible meshing may be used for constructing sweeps, suitable for finite element analysis, between two base polygons. They may also be used for meshing a given sequence of polygons forming a sweep. We present a method to compute compatible triangulations of planar polygons, sometimes requiring extra (Steiner) vertices. Experimental results show that for typical real-life inputs, the number of Steiner vertices introduced is very small. However, having a small number of Steiner vertices, these compatible triangulations are usually not of high quality, i.e. they do not have well-shaped triangles. We show how to increase the quality of these triangulations by adding Steiner vertices in a compatible manner, using remeshing and mesh smoothing techniques. The total scheme results in high-quality compatible meshes with a small number of triangles. These meshes may then be morphed to obtain the intermediate triangulated sections of a sweep, if needed.
引用
收藏
页码:147 / 156
页数:10
相关论文
共 23 条
[1]
Alexa M, 2000, COMP GRAPH, P157, DOI 10.1145/344779.344859
[2]
[Anonymous], P 7 INT MESH ROUNDT
[3]
[Anonymous], P 5 INT MESH ROUNDT
[4]
ON COMPATIBLE TRIANGULATIONS OF SIMPLE POLYGONS [J].
ARONOV, B ;
SEIDEL, R ;
SOUVAINE, D .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1993, 3 (01) :27-35
[5]
Babikov M, 1997, P 9 CAN C COMP GEOM, P6
[6]
CANANN SA, 1998, P 7 INT MESH ROUNDT, P479
[7]
Parametrization and smooth approximation of surface triangulations [J].
Floater, MS .
COMPUTER AIDED GEOMETRIC DESIGN, 1997, 14 (03) :231-250
[8]
How to morph tilings injectively [J].
Floater, MS ;
Gotsman, C .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1999, 101 (1-2) :117-129
[9]
Guaranteed intersection-free polygon morphing [J].
Gotsman, C ;
Surazhsky, V .
COMPUTERS & GRAPHICS-UK, 2001, 25 (01) :67-75
[10]
Constructing piecewise linear homeomorphisms of simple polygons [J].
Gupta, H ;
Wenger, R .
JOURNAL OF ALGORITHMS, 1997, 22 (01) :142-157