| 多曲线求交的批量解法 |
| |
| 引用本文： | 乔彦友,武红敢.多曲线求交的批量解法[J].测绘学报,1997,26(1):47-51. |
| |
| 作者姓名： | 乔彦友 武红敢 |
| |
| 作者单位： | [1]中国科学院遥感应用研究所 [2]中国林业科学研究院资源信息所 |
| |
| 摘 要： | 本文提出了求解大量曲线交点的一种批量解法，在该算法运行时，将首先应用矢量栅格化方法探测可能相交的曲线和交点的大致位置，然后从这些结果出发经数学运算得到精确的曲线交点，从而减少了曲线求交的计算量。本算法可提高地理信息系统及计算机制图系统中矢量数据求交运算的速度，从而增强它们的数据处理能力。
|
| 关 键 词： | GIS 多曲线求交 批量解法 计算机 制图 |
AN ALGORITHM TO COMPUTE INTERSECTIONS OF MANY ARCS |
| |
| Qiao Yanyou.AN ALGORITHM TO COMPUTE INTERSECTIONS OF MANY ARCS[J].Acta Geodaetica et Cartographica Sinica,1997,26(1):47-51. |
| |
| Authors: | Qiao Yanyou |
| |
| Abstract: | A new algorithm to compute intersections of many arcs is suggested in this paper. In this algorithm, rasterization of arcs is firstly used to detect the arcs that may intersect each other and the possible intersections. Based on these result, all accurate intersections can be obtained through mathematical computation, so that the total computations are reduced. The application of this algorithm can raise the speed for the computation of vector intersections in GIS and computer cartography, and hence improved their data processing abilities. |
| |
| Keywords: | Computation of intersection Rasterization GIS Computer cartography |
| 本文献已被 CNKI 维普 等数据库收录！ |
