| 基于Voronoi图和三角剖分的闭合曲线重建 |
| |
| 引用本文： | 钟华,王加阳,谭正华.基于Voronoi图和三角剖分的闭合曲线重建[J].计算机工程,2010,36(21):81-82,85. |
| |
| 作者姓名： | 钟华 王加阳 谭正华 |
| |
| 作者单位： | (中南大学 a. 信息科学与工程学院；b. 资源与安全工程学院，长沙 410083) |
| |
| 摘 要： | 以Voronoi图和Delaunay三角剖分为基础，针对二维闭合曲线集的采样点集，提出一种曲线重建算法。该算法按给定采样密度对曲线集进行采样，从而用一条或多条线段准确地重建曲线集，将采样点密集程度的度量定义为点集的本地特征值度量，以此要求采样达到一定的密集程度。理论分析证明该算法的时间复杂度为O(nlogn)。
|
| 关 键 词： | 曲线重建 点的局部特征值 Voronoi图 Delaunay三角剖分 |
Closed Curve Reconstruction Based on Voronoi Diagram and Triangulation |
| |
| ZHONG Hua,WANG Jia-yang,TAN Zheng-hua.Closed Curve Reconstruction Based on Voronoi Diagram and Triangulation[J].Computer Engineering,2010,36(21):81-82,85. |
| |
| Authors: | ZHONG Hua WANG Jia-yang TAN Zheng-hua |
| |
| Affiliation: | (a. College of Information Science and Engineering; b. School of Resources and Safety Engineering, Central South Univ., Changsha 410083, China) |
| |
| Abstract: | Based on Voronoi diagram and Delaunay triangulation and aiming at sample set of 2D closed curve set, this paper proposes a curves reconstruction algorithm. It samples the curve set according to sample dense to correctly reconstruct curve set with one or some lines. The measurement of dense extent is defined as local feature size of point, and samples are demanded to achieve a certain dense degree. Analysis proves that time complexity of the algorithm is O(nlogn). |
| |
| Keywords: | curve reconstruction local eigenvalue of point Voronoi diagram Delaunay triangulation |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
