| 关于优化n条线段求交算法的研究 |
| |
| 引用本文： | 程昌秀,严泰来.关于优化n条线段求交算法的研究[J].测绘工程,2001,10(3):29-31. |
| |
| 作者姓名： | 程昌秀 严泰来 |
| |
| 作者单位： | 中国农业大学资源与环境学院，北京 100094 |
| |
| 摘 要： | 首先分析了n条线段相交算法的不足，然后系统地阐述利用扫视法缩小求交线段的范围，利用点位判别法高效判断两线段是否相交的理论，从而提出了一套较为优化的n条线段求交算法。本文对其算法给出详细的分析和讨论，最后指出此算法的适用范围。
|
| 关 键 词： | 线段求交 扫视法 点位判别法 时间复杂度 地理信息系统 土地信息系统 |
| 文章编号： | 1006-7949(2001)03-0029-03 |
| 修稿时间： | 2001年2月5日 |
Optimize Algorithms of Intersecting of n Lines |
| |
| CHENG Chang-xiu,YAN Tai-lai.Optimize Algorithms of Intersecting of n Lines[J].Engineering of Surveying and Mapping,2001,10(3):29-31. |
| |
| Authors: | CHENG Chang-xiu YAN Tai-lai |
| |
| Abstract: | The paper analyzed the feasibility of optimizing algorithms of Intersecting of n lines,expatiat-ed two theory about it-one is scan theory to shrink the scope of be compared lines,another is point po-sition theory to judge the situation of two line intersection,and concluded an solution about it.At last,formulated its time complexity,and pointed out its feasible application scope. |
| |
| Keywords: | Intersect of n lines Scan theory Point position theory Time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
