%0 Journal Article
%A LI Shuixiang
%A CHEN Bin
%A ZHAO Liang
%A LIU Yuewu
%T A Fast Mesh Generation Algorithm with Point, by, Point Delaunay Insertion
%D 2007
%R
%J Acta Scientiarum Naturalium Universitatis Pekinensis
%P 302-306
%V 43
%N 3
%X A grouped double link data structure corresponding to element inserting coefficient (EIC) is presented to eliminate the search for the maximum EIC element in the point, by, point center insertion algorithm. Adjacency search, double linked element list, random direction search, adjacency rotation, and heredity of geometrical quantities are applied to increase the efficiency of mesh generation. The relationship between the computing time and the number of generated elements is nearly linear and the time complexity is *O*(*N*^{1.05}),*N*, where N is the number of elements. Example shows the generating rate of this algorithm is above 50?000 tetrahedrons per second on an AMD Athlon 3200+(2.0?GHz) personal computer.
%U https://xbna.pku.edu.cn/EN/abstract/article_1738.shtml