期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A new insertion sequence for incremental Delaunay triangulation 被引量:4
1
作者 Jian-Fei Liu Jin-Hui Yan S.-H. Lo 《Acta Mechanica Sinica》 SCIE EI CAS CSCD 2013年第1期99-109,共11页
Incremental algorithm is one of the most popular procedures for constructing Delaunay triangulations (DTs). However, the point insertion sequence has a great impact on the amount of work needed for the construction ... Incremental algorithm is one of the most popular procedures for constructing Delaunay triangulations (DTs). However, the point insertion sequence has a great impact on the amount of work needed for the construction of DTs. It affects the time for both point location and structure update, and hence the overall computational time of the triangulation algorithm. In this paper, a simple deterministic insertion sequence is proposed based on the breadth-first-search on a Kd-tree with some minor modifications for better performance. Using parent nodes as search-hints, the proposed insertion sequence proves to be faster and more stable than the Hilbert curve order and biased randomized insertion order (BRIO), especially for non-uniform point distributions over a wide range of benchmark examples. 展开更多
关键词 Incremental delaunay triangulation algorithms Insertion sequences KD-TREE
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部