欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
论述了在原Voronoi图的基础上增加点和删去点后生成新Voronoi图的算法。在增点过程中,针对新增加点后不满足Delaunay三角网特性的情况,利用最大最小角规则进行局部优化,根据优化后的三角网生成新Voronoi图;在删点过程中,针对删点的不同位置情况,修改相应Voronoi域,生成新Voronoi图。
英文摘要：
This paper discussed a method of building a new Voronoi diagram after adding a point to the old Voronoi diagram or deleting point from the old one.In allusion to the new point which is not conform to the characteristic of Delaunay triangle,the method uses the max-min angle principle to make the part triangle optimization,and build the new Voronoi diagram based on the optimized triangle.In the process of deleting point,in allusion to different position of deleted point,the method modifies the corresponding region and builds the new Voronoi diagram.
同期刊论文项目
同项目期刊论文
期刊信息
位置：