| 可形变简单多边形重建算法 |
| |
| 引用本文： | 吴仲乐,罗立民.可形变简单多边形重建算法[J].东南大学学报(自然科学版),2003,33(1):86-89. |
| |
| 作者姓名： | 吴仲乐 罗立民 |
| |
| 作者单位： | 东南大学生物科学与医学工程系影像科学技术实验室,南京,210096 |
| |
| 摘 要： | 构造了一个多边形边的形变模型，利用格雷厄姆快速算法得到平面点集凸包，通过添加点的方法有选择地修正凸包的一些边界，使得经过形变后的多边形在形状上更加接近平面点集的外形轮廓，分析了形变过程中边界附近点集的疏密对插入新点的影响，提出了2种插入新点的方法，该算法与点集中的点次序独立并且能够在一定程度上控制多边形的精度，实验表明该算法结果良好。
|
| 关 键 词： | 简单多边形 算法 计算几何 凸包 形变技术 平面点集 图像重建 计算机图形学 |
| 文章编号： | 1001-0505(2003)01-0086-04 |
Deformable simple polygon reconstruction algorithm |
| |
| Wu Zhongle,Luo Limin.Deformable simple polygon reconstruction algorithm[J].Journal of Southeast University(Natural Science Edition),2003,33(1):86-89. |
| |
| Authors: | Wu Zhongle Luo Limin |
| |
| Abstract: | An approach is presented to deform the selected edges of a convex polygon for getting a simple polygon which is closer to the outside shape of a point set within a plane. The convex polygon of a point set is constructed by Graham's algorithm. The selection of edges to make deform is controlled by a precision factor and the deformation is made through adding new points to the edge. In the deformation progress, according to the density of points near to the selected edges, different ways for inserting points are considered. The algorithm is independent of the sequence of points. |
| |
| Keywords: | computational geometry convex polygon deformable technology |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
