| 多边形链求交的改进算法 |
| |
| 引用本文： | 陈正鸣,李春雷.多边形链求交的改进算法[J].计算机辅助设计与图形学学报,2004,16(12):1713-1718. |
| |
| 作者姓名： | 陈正鸣 李春雷 |
| |
| 作者单位： | 河海大学计算机及信息工程学院,常州,213022 |
| |
| 基金项目： | 国家自然科学基金 (60 3 740 5 3 )资助 |
| |
| 摘 要： | 多边形链求交是CAD&CG及相关领域研究中的一个基本问题 利用多边形链的凸凹性、单调性等特性 ,结合包围盒技术 ,在扫描线算法基础上 ,提出一种多边形链求交的改进算法 该算法特别适用于包含大量直线段且交点数相对于顶点数少得多的多边形链求交的情况
|
| 关 键 词： | 多边形链 扫描线 求交 单调链 包围盒 |
An Improved Algorithm for Polygonal Chain Intersection |
| |
| Chen Zhengming,Li Chunlei.An Improved Algorithm for Polygonal Chain Intersection[J].Journal of Computer-Aided Design & Computer Graphics,2004,16(12):1713-1718. |
| |
| Authors: | Chen Zhengming Li Chunlei |
| |
| Abstract: | Finding intersections with a polygonal chain or among several chains is the fundamental operations in CAD/CAM and CG By using monotony and convexity concavity of polygonal chain as well as box technique, an improved algorithm for polygonal chain intersection is proposed based on the line scan conversion algorithm The proposed algorithm is best suited for finding intersections among polygonal chains with densely spaced vertices |
| |
| Keywords: | polygonal chains scan line intersection monotonic chain box |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
