高级检索
    李春干, 李崇贵, 景海涛. 森林小班多边形的自动聚合[J]. 北京林业大学学报, 2005, 27(1): 55-58.
    引用本文: 李春干, 李崇贵, 景海涛. 森林小班多边形的自动聚合[J]. 北京林业大学学报, 2005, 27(1): 55-58.
    LI CHUN-gan, LI Chong-gui, JING Hai-tao. Automatic combination of forest subcompartment polygons.[J]. Journal of Beijing Forestry University, 2005, 27(1): 55-58.
    Citation: LI CHUN-gan, LI Chong-gui, JING Hai-tao. Automatic combination of forest subcompartment polygons.[J]. Journal of Beijing Forestry University, 2005, 27(1): 55-58.

    森林小班多边形的自动聚合

    Automatic combination of forest subcompartment polygons.

    • 摘要: 该文以森林分布图为例讨论了林业调查规划数字专题图编制的一般方法和步骤,确定了森林小班多边形聚合的原则,提出了属性势能和属性势差概念及小班多边形聚合的算法,研究了基于MapBasic的多边形自动聚合数据处理流程和程序设计的关键技术,并在此基础上研制了森林小班多边形的聚合程序.运行结果表明,该程序不仅全面实现了小班多边形自动聚合的目的,而且与人机交互操作相比,具有速度快、精度高等特点.

       

      Abstract: To improve the efficiency of making theme-maps for forest investigations and planning, this paper discusses the general methods and processes of making digital theme-maps based on the maps of the forest distribution. The authors establish the main principles of the combination of the subcompartment polygons, present the concept of potential-energy and the difference of potential-energy of attribute and the arithmetic of the combination of the subcompartment polygons.The authors have developed a group of programs in MapBasic based on the research of data and some key technologies of the auto-combination of polygons. The results indicate that not only the auto-combination of subcompartment polygons can be achieved, but also the efficiency and precision can be improved compared with the alternative method of interface between man and computer.

       

    /

    返回文章
    返回