摘要
在森林资源图形信息管理中,森林资源二类调查小班边界的现状与动态都面临着边界数据的动态管理。针对这一问题,以邻接多边形描述边界,并采用面向对象程序设计语言中类的概念,构建一种邻接多边形的数据存储方式及其相应的算法,该数据结构可提供一种动态、渐进的多边形搜索算法,多边形数据的静态存储方式和具有拓扑结构的邻接多边形的重建。
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.
出处
《南京林业大学学报（自然科学版）》
CAS
CSCD
北大核心
2011年第5期69-73,共5页
Journal of Nanjing Forestry University：Natural Sciences Edition
基金
国家自然科学基金项目(30571491)
关键词
邻接多边形
数据结构
小班边界
adjoining polygon
data structure
subcompartment border
