A new insertion sequence for incremental Delaunay triangulation

• 作 者: Jian-Fei Liu Jin-Hui Yan S. H.
• 机 构: DepartmentofMechanicsandAerospaceEngineering,DepartmentofCivilEngineering
• 出 处: 力学学报：英文版
• 发表日期: 2013年1期
• 关键词: DELAUNAY三角网 插入序列 增量算法 广度优先搜索 三角剖分算法 计算时间 希尔伯特 均匀分布 Incremental Delaunay triangul
• 基金项目: The project was supported by the National Natural Science Foundation of China （10972006 and 11172005） and the National Basic Research Program of China （2010CB832701）. The authors would like to thank t

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 poi