南京林业大学学报(自然科学版) ›› 2011, Vol. 35 ›› Issue (05): 69-73.doi: 10.3969/j.jssn.1000-2006.2011.05.015

• 研究论文 • 上一篇    下一篇

基于GIS森林小班边界的邻接多边形数据结构

吕志英,佘光辉*   

  1. 南京林业大学森林资源与环境学院,江苏南京210037
  • 出版日期:2011-09-30 发布日期:2011-09-30
  • 基金资助:
    收稿日期:2011-01-04修回日期:2011-05-30基金项目:国家自然科学基金项目(30571491)作者简介:吕志英(1967—),副研究员,博士生。*佘光辉(通信作者),教授。Email: ghshe@njfu.com.cn。

Adjoining polygons data structure of forest subcompartment border based on GIS

L Zhiying, SHE Guanghui*   

  1. College of Forest Resources and Environment, Nanjing Forestry University, Nanjing 210037, China
  • Online:2011-09-30 Published:2011-09-30

摘要: 在森林资源图形信息管理中,森林资源二类调查小班边界的现状与动态都面临着边界数据的动态管理。针对这一问题,以邻接多边形描述边界,并采用面向对象程序设计语言中类的概念,构建一种邻接多边形的数据存储方式及其相应的算法,该数据结构可提供一种动态、渐进的多边形搜索算法,多边形数据的静态存储方式和具有拓扑结构的邻接多边形的重建。

Abstract: In the graphics information management of forest resources, the current state and dynamics of the subcompartments borders derived from forest resources inventories always face with the issue of dynamic update of the borders data. Aiming to this, the adjoining polygon structure is used to depict borders and the concept of class of the object oriented programming language, a storage manner for the adjoining polygons is constructed. The corresponding algorithms is further developed in this work. Ultimately, a dynamic and gradual polygon search algorithm was realized. The static storage manner of polygon data blocks and the topological polygons reconstruction was supported in this polygon data structure.

中图分类号: