MESH RELAXATION - A NEW TECHNIQUE FOR IMPROVING TRIANGULATIONS

被引:89
作者
FREY, WH
FIELD, DA
机构
[1] Mathematics Department, General Motors Research Laboratories, Warren, Michigan
关键词
D O I
10.1002/nme.1620310607
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Given a list of points defining a domain boundary, a three-stage process is often used to triangulate a domain. First, an appropriate distribution of interior points is generated. Next the points are connected to form triangles. And, finally, the connectivity data are used to reposition the interior points using the Laplacian smoothing technique, thereby usually improving the shapes of the triangles. This paper describes a new technique for mesh improvement-adjusting the connection structure during the second stage of this process. The new scheme, which we call mesh relaxation, consists of a procedure for iteratively making the mesh topology more regular by edge swapping. For each interior edge, a relaxation index is computed that depends on the degrees of its end points and adjacent points. Any edge for which this index exceeds a prescribed threshold will be swapped, i.e. replaced by a new edge connecting the adjacent points of the original edge. After all edge swaps are completed, Laplacian smoothing is applied to the mesh. Examples show that, when the mesh point density varies smoothly and due care is taken in the vicinity of the boundary, mesh relaxation can dramatically increase the regularity of the mesh and produce improved triangle shapes.
引用
收藏
页码:1121 / 1133
页数:13
相关论文
共 18 条
[1]   ANGLE CONDITION IN FINITE-ELEMENT METHOD [J].
BABUSKA, I ;
AZIZ, AK .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1976, 13 (02) :214-226
[2]  
BAKER B, 1985, 844 AT T BELL LAB NU
[3]   3-DIMENSIONAL AND 4-DIMENSIONAL SURFACES [J].
BARNHILL, RE ;
LITTLE, FF .
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 1984, 14 (01) :77-102
[4]   COMPUTING DIRICHLET TESSELLATIONS [J].
BOWYER, A .
COMPUTER JOURNAL, 1981, 24 (02) :162-166
[5]  
Busacker R.G., 1965, FINITE GRAPHS NETWOR
[6]  
CAVENDISH JC, 1985, INT J NUMER METH ENG, V21, P329
[7]   AN APPROACH TO THE GENERATION OF TRIANGULAR GRIDS POSSESSING FEW OBTUSE TRIANGLES [J].
DELJOUIERAKHSHANDEH, K .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1990, 29 (06) :1299-1321
[8]   LAPLACIAN SMOOTHING AND DELAUNAY TRIANGULATIONS [J].
FIELD, DA .
COMMUNICATIONS IN APPLIED NUMERICAL METHODS, 1988, 4 (06) :709-712
[9]  
FIELD DA, 1987, GMR5675 GEN MOT RES
[10]   SELECTIVE REFINEMENT - A NEW STRATEGY FOR AUTOMATIC NODE PLACEMENT IN GRADED TRIANGULAR MESHES [J].
FREY, WH .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1987, 24 (11) :2183-2200