DocumentCode
1013839
Title
Computing constrained triangulation and Delaunay triangulation: a new algorithm
Author
Jian-ming, Zhou ; Ke-ran, Shao ; Ke-ding, Zhou ; Qiong-hua, Zhan
Author_Institution
Dept. of Electr., Eng., Huazhong Univ. of Sci. & Technol., Hubei, China
Volume
26
Issue
2
fYear
1990
fDate
3/1/1990 12:00:00 AM
Firstpage
694
Lastpage
697
Abstract
A novel algorithm for computing optimal constrained triangulation is presented which is equally applicable to 2-D and 3-D optimal constrained triangulation and Delaunay triangulation. This algorithm has no degenerate and near-degenerate problems. The same amount of time is needed to add a new point to an existing mesh of any element number provided that the element it belongs to has been predetermined, as in the self-adaptive finite-element analysis process. This algorithm has been applied to finite-element mesh generation. Test results are given
Keywords
electromagnetic field theory; finite element analysis; optimisation; 2D constrained triangulation; 3D optimal constrained triangulation; Delaunay triangulation; algorithm; finite-element mesh generation; self-adaptive finite-element analysis process; Algorithm design and analysis; Computational geometry; Finite element methods; Heart rate; Interpolation; Mesh generation; Partial response channels; Testing;
fLanguage
English
Journal_Title
Magnetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9464
Type
jour
DOI
10.1109/20.106412
Filename
106412
Link To Document