COMPUTING CONSTRAINED TRIANGULATION AND DELAUNAY TRIANGULATION - A NEW ALGORITHM

被引:6
作者
ZHOU, JM
SHAO, KR
ZHOU, KD
ZHAN, QH
机构
[1] Dept. of Elec. Engn., Huashong Univ. of sci. &. Tech., Wuhan, Hubei
关键词
D O I
10.1109/20.106412
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a new algorithm for computing optimal constrained triangulation. It is equally applicable to compute 2D and 3D optimal constrained. triangulation and Delaunay triangulation. This algorithm has no socalled degenerate and near degenerate problems. The time needed to add. a new point to an existing mesh of any element number is the same provided that the element it belongs to has been predetermined as in the self-adaptive finite elemente analysis process. This algorithm has been applied to finite element mesh generation. Test results are given in this paper. © 1990, IEEE. All rights reserved.
引用
收藏
页码:694 / 697
页数:4
相关论文
共 11 条
[1]   COMPUTING DIRICHLET TESSELLATIONS [J].
BOWYER, A .
COMPUTER JOURNAL, 1981, 24 (02) :162-166
[2]  
CAVENDISH JC, 1985, INT J NUMER METH ENG, V21, P329
[3]   MAGNETIC-FIELD COMPUTATION USING DELAUNAY TRIANGULATION AND COMPLEMENTARY FINITE-ELEMENT METHODS [J].
CENDES, ZJ ;
SHENTON, D ;
SHAHNASSER, H .
IEEE TRANSACTIONS ON MAGNETICS, 1983, 19 (06) :2551-2554
[4]   COMPUTING DIRICHLET TESSELLATIONS IN PLANE [J].
GREEN, PJ ;
SIBSON, R .
COMPUTER JOURNAL, 1978, 21 (02) :168-173
[5]  
LAWSON CL, 1977, MATH SOFTWARE, V3
[6]  
LEE DT, 1980, INT J COMP INF SCI, V9
[7]   3-DIMENSIONAL FINITE-ELEMENT MESH GENERATION USING DELAUNAY TESSELATION [J].
SHENTON, DN ;
CENDES, ZJ .
IEEE TRANSACTIONS ON MAGNETICS, 1985, 21 (06) :2535-2538
[8]  
SIBSON R, 1980, COMPUT J, V23, P243
[9]   COMPUTING THE N-DIMENSIONAL DELAUNAY TESSELLATION WITH APPLICATION TO VORONOI POLYTOPES [J].
WATSON, DF .
COMPUTER JOURNAL, 1981, 24 (02) :167-172
[10]   A MODIFIED QUADTREE APPROACH TO FINITE-ELEMENT MESH GENERATION [J].
YERRY, MA ;
SHEPHARD, MS .
IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1983, 3 (01) :39-46