| 基于AutoCAD的简单多边形剖分算法 |
| |
| 引用本文： | 刘彦鹏,吴明光,张玉润.基于AutoCAD的简单多边形剖分算法[J].计算机工程与应用,2006,42(5):43-45,49. |
| |
| 作者姓名： | 刘彦鹏 吴明光 张玉润 |
| |
| 作者单位： | 浙江大学信息科学与工程学院系统工程研究所,杭州,310027 |
| |
| 基金项目： | 浙江省杭州市"5112"工程项目 |
| |
| 摘 要： | 在充分挖掘AutoCAD图形中简单多边形自身隐含的垂直与共线关系的基础上,提出一种新的基于直角顶点判定和凹凸顶点判定的简单多边形剖分算法。该算法首先判断出多边形顶点的直角特性和凹凸性,然后根据多边形自身的特点按照一定的先后次序进行剖分,力求把多边形分割成直角梯形、矩形和直角三角形的形式。其中判断辅助线连接次序的优先级是实现剖分算法的关键。程序实现中采用递归算法,对分割后的多边形重新进行判断,直到多边形分割完毕。
|
| 关 键 词： | AutoCAD 简单多边形 凹凸顶点 递归算法 |
| 文章编号： | 1002-8331-（2006）05-0043-03 |
| 收稿时间： | 2005-06 |
| 修稿时间： | 2005-06 |
A New Decomposition Algorithm of Simple Polygon Based on AutoCAD |
| |
| Liu Yanpeng,Wu Mingguang,Zhang Yurun.A New Decomposition Algorithm of Simple Polygon Based on AutoCAD[J].Computer Engineering and Applications,2006,42(5):43-45,49. |
| |
| Authors: | Liu Yanpeng Wu Mingguang Zhang Yurun |
| |
| Affiliation: | Institute of System Engineering,College of Information Science and Engineering, Zhejiang University, Hangzhou 310027 |
| |
| Abstract: | A new decomposition algorithm of simple polygon based on determination of right-angled vertices and convex-concave vertices is presented by fully mining vertical and lined relationship of polygon itself in AutoCAD.Its basic idea is to calculate right-angled vertices and convex-concave vertices first,then try to decompose polygon into rectangles right-angled triangles and trapezias according to specific priorities.The determination of connection order of assistant line is the key of algorithm.Recursion algorithm is used in programming,and repeat the above steps for each new polygon until termination condition is met. |
| |
| Keywords: | AutoCAD |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
