| 一种分割平面简单多边形的高效算法 |
| |
| 引用本文： | 韩瑜,;张正峰. 一种分割平面简单多边形的高效算法[J]. 陕西工学院学报, 2009, 0(1): 47-50 |
| |
| 作者姓名： | 韩瑜, 张正峰 |
| |
| 作者单位： | [1]陕西电视广播大学基础部,陕西西安710072; [2]西北工业大学软件与微电子学院,陕西西安710072 |
| |
| 摘 要： | 简单多边形的分割问题是图形图像处理过程中的一个基本问题，已有的算法复杂度高且实现繁琐。利用链表这种简单的数据结构实现的新算法，其时间复杂度为，空间复杂度是，减少了计算开销，提高了运算速度。通过实际软件应用表明该算法实现简单，且高效、准确，因而有很好的实用性。
|
| 关 键 词： | 简单多边形 折线 分割 |
An effective algorithm of dividing plane simple polygon |
| |
| Affiliation: | HAN Yu, ZHANG Zheng-feng ( 1. Department of Bsic Sciences,Shanxi Radio ＆ TV University, Xi＇an 710072, China; 2. Software and Micro-electronics Academy NWPU, Xi＇an 710072, China) |
| |
| Abstract: | Dividing simple polygon is a basic problem in the process of graphics, and the former algorithms had high time complexity and were complicated to be realized. The new algorithm with the structure of link-list reduces the expenses of computation and enhances the speed of operation, because the more complex the time is, the more complex the space is. It has been proved that the algorithm has such advantages as highly effective,accuratcy and easy to realize through application in some softwares, so it is practical. |
| |
| Keywords: | simple polygon broken line division |
| 本文献已被 维普 等数据库收录！ |
|
