DocumentCode :
2821425
Title :
Endpoint Triangle´s Circumcircle Method in Delaunay Triangulation
Author :
Zhao, Yuxin ; Tian, Fengmin
Author_Institution :
Coll. of Autom., Harbin Eng. Univ., Harbin, China
Volume :
2
fYear :
2009
fDate :
24-26 April 2009
Firstpage :
264
Lastpage :
268
Abstract :
In this paper, an improved algorithm of node refinement scheme called endpoint triangle´s circumcircle method (ETCM) is proposed, which has linear time complexity. Regarding stability, new nodes quantity, time cost and mesh quality as criterions, ETCM and existing node refinement algorithms are evaluated by simulations. The results show that the time cost of ETCM is more independent of data distribution than the existing algorithms, while the performances on other criterions of ETCM are almost the same as the best of existing algorithms.
Keywords :
computational complexity; computational geometry; graph theory; mesh generation; Delaunay triangulation; ETCM; data distribution; endpoint triangle circumcircle method; feature line insertion; graph theory; linear time complexity; mesh quality criterion; node quantity criterion; node refinement algorithm; time cost criterion; Automation; Convergence of numerical methods; Costs; Data engineering; Data structures; Educational institutions; Finite element methods; Linearity; Optimization methods; Stability criteria; Circumcircle; Delaunay Triangulation; node refinement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on
Conference_Location :
Sanya, Hainan
Print_ISBN :
978-0-7695-3605-7
Type :
conf
DOI :
10.1109/CSO.2009.385
Filename :
5193947
Link To Document :
بازگشت