摘要
文章讨论了建立离散点Delaunay三角剖分算法的研究现状,针对"逐点插入法"采用网格分块的方法对构网离散点集和已生成的三角网建立索引,提高了点在三角网中的定位效率和三角网的生成效率。
This thesis presents the status of Delaunay triangulation meithods,In incremental insertation algorithmi,t organizes the point set and triangle by constructing Grid index to enhance the query speed of searching for the triangle that contains the given point.With the improving measures,the efficiency of algorithm is greatly improved.
出处
《电脑与信息技术》
2010年第4期29-31,44,共4页
Computer and Information Technology
