摘要
本文提出了在计算机自动联结三角网时从相邻有限矩形网格中寻找当前扩展边的扩展点的算法，该算法是对文献［１］中相应算法的改进和进一步完善，适合于大数据量区域的联网。
This paper put s forward algorithms for searching the expanding point of being expanded side from adjacent limited grids while computer links triangular net automatically.Itimproves and further perfects the algorithms discussed in a published paper￣[1].and is suitablefor the net joinning of a large data-area.
出处
《中国矿业大学学报》
EI
CAS
CSCD
北大核心
1995年第4期76-79,共4页
Journal of China University of Mining & Technology
