| 基于二维凸多边形内散乱点的三角划分新算法 |
| |
| 引用本文： | 杜丽美,顾耀林. 基于二维凸多边形内散乱点的三角划分新算法[J]. 计算机工程与应用, 2009, 45(25): 179-182. DOI: 10.3778/j.issn.1002-8331.2009.25.055 |
| |
| 作者姓名： | 杜丽美 顾耀林 |
| |
| 作者单位： | 江南大学,信息工程学院,江苏,无锡,214122;江南大学,信息工程学院,江苏,无锡,214122 |
| |
| 摘 要： | 基于给定的平面散点数据，提出了逐层提取轮廓线，并将轮廓线之间的区域进行三角划分的新算法。实现这一算法的关键是在给定阈值的条件下逐层提取内部离散点的轮廓线，再在所提取的轮廓线间进行等比例三角划分。最后，利用Lawson提出的局部优化过程来优化分割好的三角形网。通过实验证明了算法的有效性。
|
| 关 键 词： | 散乱点构型 轮廓线 二维表面三角划分 局部最优化处理 重构 |
| 收稿时间： | 2008-05-27 |
| 修稿时间： | 2008-9-4 |
New algorithm of building delaunay based on 2D scattered points of convex polygon |
| |
| DU Li-mei,GU Yao-lin. New algorithm of building delaunay based on 2D scattered points of convex polygon[J]. Computer Engineering and Applications, 2009, 45(25): 179-182. DOI: 10.3778/j.issn.1002-8331.2009.25.055 |
| |
| Authors: | DU Li-mei GU Yao-lin |
| |
| Affiliation: | Department of Information Engineering，Jiangnan University，Wuxi，Jiangsu 214122，China |
| |
| Abstract: | Based on the 2D scattered points,a quick method for the triangulation between two contour lines is proposed.The problem of the new algorithm is to pick up the interior contour line,then plot out the triangle between the contour lines.Finally, local optimization procedure of Lawson's is done on the model.Experiment shows that this method is effective. |
| |
| Keywords: | scattered points contour line triangulation on surface of 2D object local optimization procedure reconstruction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
