欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
Voronoi图是计算几何中的重要概念之一，在计算机图形学、计算几何、计算机辅助几何设计、有限元网格划分、机器人轨迹控制、模式识别、气象学和地质学研究中得到广泛应用。借助于四叉树和区间算术，提出了一种新的构造平面点集Voronoi图的细分算法，并且和经典的增量算法、栅格扩张法进行了比较，结果显示新细分算法更为有效。最重要的是细分算法原理简单，很容易编程实现。
英文摘要：
Voronoi diagram is one of the most important concepts in computational geometry, It is applied widely in computer graphics, computational geometry, computer aided geometric design, finite element grid partition, robot trajectory control, pattern recognition, meteorology and geology. Based on quadtree data structure and interval arithmetic technique, a new subdivision algorithm for Voronoi diagram of a planar point set is proposed. A comparison of this subdivision algorithm with the well known incremental algorithm and grid expansion method is conducted. Test results show that the subdivision algorithm is more efficient. The most important is that the idea of subdivision algorithm is very simple and therefore it is easy to implement.
同期刊论文项目
同项目期刊论文
期刊信息
位置：