顾及多重约束的土地利用数据库制图综合研究
|
摘要
土地利用数据库是对土地利用现状进行详细调查所获得的专题型数字化成果数据库。主要用于土地资源管理,以反映土地的地理位置、数量、质量、空间分布、土地利用类型、权属和利用情况等。与一般的地理数据类似,土地利用数据包含空间数据和属性数据两部分,其中,土地利用空间数据中的地类图斑具有覆盖整个空间区域无缝隙的特点,土地利用属性数据蕴含丰富的语义信息和多层次类型划分的专题特征。因此,土地利用数据库制图综合有别于传统的普通地图数据库制图综合,它是制图综合理论与技术在土地利用专题数据领域的典型性应用,其目的是为了提高地图的可读性和可理解性。在制图综合处理过程中,除了要考虑传统的制图理论因素外,还需要根据应用目标需求和制图区域的特点,综合考虑该区域地类图斑分布模式、统计特征、语义、拓扑、图形、精度等多种约束因素,按照综合的先后约束顺序进行系统化的综合处理。目前,很多学者对土地利用数据制图综合进行了大量的研究,取得了一系列研究成果。但是,这些研究在综合方式上主要还是以交互式综合为主,智能化程度不高；在综合算法上,由于实施多重约束的困难性,算法通常都只顾及了某种约束条件或侧重于综合的某一方面,导致顾此失彼,而土地利用数据制图综合是一个系统工程,需要从多个方面综合考虑各种约束因素。因此,分析研究土地利用数据制图综合的多重约束因素,探讨顾及多重约束条件的面向土地利用数据库制图综合的自动综合算法和研究智能化的综合系统在理论和实际应用中都具有非常重要的意义。
本文主要以土地利用数据库中的地类图斑为研究对象,考察其在综合过程中应遵循的合理综合流程、被实施的主要综合操作以及各种操作需要顾及的多重约束条件；按照综合操作实施的先后顺序,选取图斑归并综合、狭长图斑降维综合和图斑化简综合三种最常用的图斑综合操作,研究其在多重约束条件控制下的自动综合方法,并构建智能化的土地利用数据库综合系统,通过1：10000到1：50000的土地利用数据自动综合实验和对实验结果进行评价分析,验证本文提出的自动综合算法的有效性和合理性以及智能化综合原型系统的可行性和实用性。具体研究工作如下：
1)介绍了本文的研究目的和意义,总结了普通地图制图综合的研究现状和土地利用图制图综合的研究现状,指出了当前面向土地利用数据制图综合研究的不足,界定了本文的研究范围及研究内容。
2)介绍了制图综合约束的基本概念和制约制图综合的因素,分析了土地利用数据的基本特征：多层的空间数据组织结构、地类图斑全覆盖和丰富的语义信息和专题特征；浅析了土地利用图与普通地图制图综合的区别；从尺度约束、结构约束、空间关系约束、语义约束、几何约束、综合过程约束六个方面构建了面向土地利用数据库制图综合的约束控制知识体系,并分别阐述了各个约束的含义和意义;从综合质量控制和综合的完整性角度考虑,给出了几种针对土地利用数据综合结果进行整体评价的方法,分别是：面积变化率、语义相似度、结构相似性和布局稳定性,以便检查综合结果是否合理,从而保证综合质量。
3)针对地类图斑自动归并综合,分析了图斑归并综合需要顾及的多重约束条件以及各约束条件实施的先后顺序,并根据图斑间的拓扑关系进一步将图斑归并综合划分为聚合、合并和融合三种类型,分析了每种类型的含义及操作方式,并指出融合操作可视为合并操作的一种特殊情况,从而将整个归并综合分为聚合和合并两大操作步骤,并分析指出聚合操作应先于合并操作实施；接着针对图斑聚合综合,提出了一种基于栅格与矢量数据模型的图斑自动聚合综合方法,该方法的思想是：先基于栅格数据模型对待聚合图斑进行自动空间区域划分及聚类分析,然后基于矢量数据模型对图斑实施自动聚合综合,从而很好的顾及了图斑的空间分布约束、语义约束、图形结构约束、精度约束等多种约束条件；针对图斑合并综合,给出了一种基于图斑临近关系分析的合并方法,其中,临近关系的度量是关键,介绍了一种顾及拓扑邻近和语义邻近的度量方法,并在此基础上,介绍了基于邻近度量的图斑合并方法以及各种地类合并应遵循的优先顺序;最后,给出了图斑归并综合的一体化自动综合流程与实验结果。
4)针对狭长多边形图斑自动降维综合,分析了狭长多边形图斑需要作降维综合处理的原因以及降维综合产生的不一致性问题,指出了现有研究的不足;介绍了一种基于CDT的狭长多边形图斑自动探测方法和图斑局部狭长部分自动分割方法,在此基础上,给出了狭长多边形图斑自动降维综合的方法；接着针对狭长多边形图斑降维综合后导致的拓扑不一致性和语义不一致性问题,分别给出了一致性自动改正方法,前者在狭长多边形图斑与其邻近多边形图斑之间的拓扑关系的基础上,将弧段分为三类,分别用Ⅰ、Ⅱ、Ⅲ表示,并指出狭长多边形图斑降维综合后的拓扑一致性改正就是保持Ⅰ类弧段不变,Ⅱ类弧段删除,Ⅲ类弧段延长到中心线并相交打断后局部拓扑重建的处理过程；后者在土地利用数据语义综合规则的基础上,对狭长多边形图斑的邻近多边形进行语义一致性改正；最后,给出了狭长多边形图斑自动降维综合的实验流程与实验结果。
5)针对图斑自动化简综合,在详细分析各种约束因素对图斑化简综合产生的影响基础上,将图斑按照所表达的地理要素特征分为自然地物和人造地物两大类,并分析了两类图斑各自的特点以及化简的优先顺序；接着针对人造地物图斑化简综合,在现有基于最小二乘法平差原理的建筑物图斑化简算法基础上,提出了一种适用于土地利用人造地物图斑化简综合且顾及多重约束因素的改进型图斑化简综合算法,该算法先对人造地物的形状结构进行探测,然后对以共享边存在的人造地物图斑进行化简前预处理,最后根据化简综合所需顾及的多重约束条件建立多个约束方程,联立方程组进行最小二乘平差解算得到最终化简结果。针对自然地类图斑化简,指出了拓扑关系、图斑边界弯曲特征和面积平衡保持是自然地类图斑化简时需要重点考虑的约束因素,并根据图斑是否被其它图斑包含,又将自然地类图斑分为岛状图斑和非岛状图斑两种,对于非岛状图斑,提出了一种基于图斑边界弯曲特征分析并顾及多重约束条件的自然地类图斑自动化简方法,该方法先利用CDT对自然地类图斑的共享边界进行弯曲探测和识别,分析其凹凸特性,然后运用渐进式化简综合思想,对共享边界进行凹凸交替式删除化简,使得在化简过程中图斑的面积尽可能的保持了平衡,最后利用夸大或删除部分弯曲来平衡化简积累的面积差,从而得到面积保持平衡的化简结果;对于岛状图斑,先用最小外包矩形对图斑边界实施分割,并对每一段按照非岛状图斑的化简策略实施化简,从而在顾及面积与弯曲特征的约束基础上,很好的顾及了图斑主方向及整体形态约束特征。为了检验图斑自动化简算法的有效性,最后给出了图斑自动化简综合的实验流程与实验结果。
6)针对土地利用数据库制图综合的实际应用需求,进行了原型系统分析与设计,并在MapGIS K9平台上用MS Visual Studio2005进行二次开发,实现了满足土地利用数据库制图综合的原型系统Landuse-Gen:该系统采用工作流的设计思想,将综合过程中所需的源数据、综合算子、综合参量、综合知识、综合规则以及其它所需资源视为综合流程中的—个节点,存放在系统的功能仓库中,制图人员根据项目预先制定的综合操作方案,将综合过程中所涉及的流程节点通过系统提供的流程搭建工具搭建成综合流程,每个流程针对—个特定的综合应用需求,其构建的过程即是制图专家综合决策的体现,因此,每个综合流程在执行时,即被赋予了人的部分知识、经验和决策能力,从而使得系统具备了一定的智能性。为了检验本综合系统的可行性和实用性,详细介绍了以广西铁山港区1：1万土地利用数据为例进行的1：5万的综合试验情况。
Land-use database is a thematic type of digital map databases which is based on a detailed survey of land-use status. It is mainly used for land resource management to reflect the land location, quantity, quality, spatial distribution, land-use type, ownership and use status etc. The same as the general geographic data, land-use data contains spatial data and attribute data, the polygons in the land-use spatial data have the characteristic of covering the entire space region with seamless distribution, and the land-use attribute data are enriched with semantic information and multi-level thematic characteristics. Therefore, land-use database cartographic generalization is different from common map database cartographic generalization, it is the typical application for cartographic generalization theory and technology taking into the field of land-use thematic data, its purpose is to improve the map's readability and understandability. In the process of cartographic generalization, it should consider the regional distribution patterns of sporadic parcels, statistical characteristics, semantics, topology, graphics, precision constraints and other factors according to the application target requirements and mapping regional characteristics, in addition to considering the traditional cartographic theory factors, it needs to generalize systematically in a comprehensively constrained order. Many scholars have done a lot of research on land use data generalization, and made a series of research results, but these studies were mainly, on the one hand, on an interactive generalization for operation lacking of intelligence, and on the other hand, these algorithm usually only took into account a certain constraint or focused on a particular aspect of generalization, due to the difficulty of implementing multiple constraints, which made the result attend to one thing and lose another, and the land-use data generalization is a systematic project, it needs to consider the various constraints. Therefore, neither in theory nor in practical applications, it is meaningful to study on multiple constraints for land use data generalization, and make research on new methods and intelligent system.
This thesis focuses on sporadic parcels of land-use database, examines its rational procedure that should be kept to in the generalization flow, the operation that generalization should be taken, and the constraints that operation should be taken into account. According to the operations' order, polygons'merging generalization, narrow and long polygons'dimension-reducing generalization and polygons'simplifying generalization which are the most common operations for the polygons' generalization are taken into account, studying on the automatically generalizing methods under the control of multiple constraints and building an intelligent land-use database generalizing system, a land-use data generalization experiment is executed from scale1:10000to1:50000, and the generalization results are assessed which is to verify the proposed algorithm whether is effective and rational and the intelligent generalizing system whether is feasible and practical. Specific research works are as follows:
1) The purpose and significance of this research is introduced, then, the general map cartographic generalization research status quo and land-use map generalization research status quo are summarized, the lack of current research on land-use data generalization is pointed out, and the scope of this thesis and the research content are defined.
2) The concept of constraint for cartographic generalization and the impact of constraint on cartographic generalization are introduced. The basic characteristics of land use data that multilayer spatial data organization, to cover the whole region by sporadic parcels and rich semantic information and thematic information are analyzed. The difference between land-use map cartography generalization with common map cartographic generalization is introduced. The systematic knowledge of constraints for land-use database cartographic general ization consist of six aspects, such as scale constraint, structural constraint, spatial relations constraint, semantic constraint, geometric constraint and operation process constraint, and each constraint's meaning and significance is elaborated. Considering the quality controlling and integrity of generalization, several methods for land-use database generalization result assessment are proposed, including area change rate, semantic similarity, structural similarity and distribution stability, which is in order to check whether the results are reasonable, and to ensure generalization quality.
3) As for sporadic parcels automatically merging generalization, what constraints that should be taken into account as well as the order that constraints should take for sporadic parcels merging generalization is analysed, and the merging generalization is divided into three types according to the topological relations between polygons, their are aggregation, consolidation, and amalgamation, each type's meaning and method of operation is given, it points out that the amalgamation operation can be considered a special case of the consolidation operation, and that the aggregation operation should be taken before the consolidation operation. Then, a method for sporadic parcels aggregation generalization is proposed based on raster and vector data model, firstly, it divides the sporadic parcels into several spatial zones and takes cluster analysis base on raster data model, secondly, it aggregates the cluster polygons based on vector data model. The method takes into account the spatial distribution constraint of polygons, semantic constraint, graph structure constraint, precision constraint and other constraints. Another method for sporadic parcels consolidation generalization is proposed based on neighborhood relationship analysis of parcels, in which the measure of neighborhood relation is the key point. A method for measuring the degree of neighborhood considering the topology and semantic constraints is introduced, and on this basis, the order for the terra-type parcels consolidation to take is given. Finally, the experiment flow for sporadic parcels automatically merging generalization and results are presented.
4) As for long and narrow polygon automatic dimension-reducing generalization, the reason that why do the long and narrow polygons need to take dimension-reducing generalization and what inconsistencies would be made by the dimension-reducing generalization is given, the lack of current research is pointed out. An method for detecting long and narrow polygon automatically and an method for segmenting the long and narrow part of polygon automatically witch are all based on CDT is proposed, on this basis, a method for long and narrow polygon automatic dimension-reducing generalization is introduced. Then, focusing on the inconsistency of topology and semantics produced by the dimension-reducing generalization, an approach for the inconsistencies correcting is given separately. The previous is based on the topology between the target polygon and its adjacent polygons, it classifies the arcs into three types, Ⅰ, Ⅱ and Ⅲ, and presents that the topology consistency correcting is keeping the type I arcs, deleting type II arcs, and prolong the type III arcs to the polygon's centerline, then, clips the arcs and rebuild the topology partly, and the latter aims at semantics consistency correcting based on the sematic rules. Finally, the experiment flow for the long and narrow polygon automatic dimension-reducing generalization and results are presented.
5) As for sporadic parcels automatically simplifying generalization, based on the detailed analysis of various constrained factors that impact on the polygons simplification, it divides the sporadic parcels into two major categories that are natural features and man-made features according to the geographic features of polygons' expression, and the characteristics of each type of polygons and simplification priorities are analyzed. In the following, an improved version of least squares adjustment for man-made features simplification algorithm considering multiple constraints is proposed base on the principle of building polygons simplification algorithm, the algorithm first detecting the structure of man-made feature, then pretreating the polygon before taking simplification that whose edges are shared by another polygon, the last, constructing various equations according to the simplification required multiple constraints, and solving the equations under the least-squares adjustment to get the final results. For natural features simplification, it points out that topological relation, the curved character of polygon's boundary and area balance maintain are mainly constraints that natural features simplification should take into account, and it divides the polygons into island polygons and non-island polygons according to whether the polygon is contained by other polygon. For the non-island polygons, an automatically simplifying algorithm is presented base on the curved character of polygon's boundary and considering multiple constraints, it first detecting and identifying the bend character of polygons shared borders base on CDT, and analyzing its convex characteristics, then taking a progressive simplification policy, it deletes the convex bend alternatively to keep the polygon's area balance as possible as it can in the process of simplification, and finally exaggerating or deleting some bend to balance polygon's accumulation area of simplification, getting the result of simplification with polygon's area kept balanced. For the island polygons, first splitting the polygon's boundary with its smallest outsourcing rectangle, then taking the policy of non-island polygon's simplification for each section, thus keeping the polygon's mainly direction and overall structure characteristics well in addition, expect containing the base area balance and bending characteristics constraints. In order to test the effectiveness of automatically simplifying algorithm for polygons, an experimental flow of polygons automatically simplifying generalization and results are presented at last.
6) A prototype system is analyzed and designed based on the actual application requirements for land use database cartographic generalization, and the prototype system called Land use-Gen which meet the land use database cartography is developed on the MapGIS K9platform using MS Visual Studio2005. The system takes a workflow policy design, which takes the required source data, generalization operators, generalization parameters, generalization knowledge, generalization rules and other necessary resources as a flow node in the generalizing process and each node is stored in the system's functional warehouse. The cartographers, according to the pre-established solution of generalizing operation for project, build the generalizing work flow with the referring flow node in the process of generalization using system's providing build tool, and each work flow is for a specific generalizing application requirements, it is a embodiment of cartographic experts decision-making for generalization. Therefore, when each work flow is executed, the generalizing process is endowed with some knowledge, experience and decision-making ability of people, and thus making the system have a certain intelligence. In order to check the system's feasibility and practicality, an experiment conducted with Tie shan gang land use data of Guang xi for generalization from1:10000to1:50000is described in detail.
本文主要以土地利用数据库中的地类图斑为研究对象,考察其在综合过程中应遵循的合理综合流程、被实施的主要综合操作以及各种操作需要顾及的多重约束条件；按照综合操作实施的先后顺序,选取图斑归并综合、狭长图斑降维综合和图斑化简综合三种最常用的图斑综合操作,研究其在多重约束条件控制下的自动综合方法,并构建智能化的土地利用数据库综合系统,通过1：10000到1：50000的土地利用数据自动综合实验和对实验结果进行评价分析,验证本文提出的自动综合算法的有效性和合理性以及智能化综合原型系统的可行性和实用性。具体研究工作如下：
1)介绍了本文的研究目的和意义,总结了普通地图制图综合的研究现状和土地利用图制图综合的研究现状,指出了当前面向土地利用数据制图综合研究的不足,界定了本文的研究范围及研究内容。
2)介绍了制图综合约束的基本概念和制约制图综合的因素,分析了土地利用数据的基本特征：多层的空间数据组织结构、地类图斑全覆盖和丰富的语义信息和专题特征；浅析了土地利用图与普通地图制图综合的区别；从尺度约束、结构约束、空间关系约束、语义约束、几何约束、综合过程约束六个方面构建了面向土地利用数据库制图综合的约束控制知识体系,并分别阐述了各个约束的含义和意义;从综合质量控制和综合的完整性角度考虑,给出了几种针对土地利用数据综合结果进行整体评价的方法,分别是：面积变化率、语义相似度、结构相似性和布局稳定性,以便检查综合结果是否合理,从而保证综合质量。
3)针对地类图斑自动归并综合,分析了图斑归并综合需要顾及的多重约束条件以及各约束条件实施的先后顺序,并根据图斑间的拓扑关系进一步将图斑归并综合划分为聚合、合并和融合三种类型,分析了每种类型的含义及操作方式,并指出融合操作可视为合并操作的一种特殊情况,从而将整个归并综合分为聚合和合并两大操作步骤,并分析指出聚合操作应先于合并操作实施；接着针对图斑聚合综合,提出了一种基于栅格与矢量数据模型的图斑自动聚合综合方法,该方法的思想是：先基于栅格数据模型对待聚合图斑进行自动空间区域划分及聚类分析,然后基于矢量数据模型对图斑实施自动聚合综合,从而很好的顾及了图斑的空间分布约束、语义约束、图形结构约束、精度约束等多种约束条件；针对图斑合并综合,给出了一种基于图斑临近关系分析的合并方法,其中,临近关系的度量是关键,介绍了一种顾及拓扑邻近和语义邻近的度量方法,并在此基础上,介绍了基于邻近度量的图斑合并方法以及各种地类合并应遵循的优先顺序;最后,给出了图斑归并综合的一体化自动综合流程与实验结果。
4)针对狭长多边形图斑自动降维综合,分析了狭长多边形图斑需要作降维综合处理的原因以及降维综合产生的不一致性问题,指出了现有研究的不足;介绍了一种基于CDT的狭长多边形图斑自动探测方法和图斑局部狭长部分自动分割方法,在此基础上,给出了狭长多边形图斑自动降维综合的方法；接着针对狭长多边形图斑降维综合后导致的拓扑不一致性和语义不一致性问题,分别给出了一致性自动改正方法,前者在狭长多边形图斑与其邻近多边形图斑之间的拓扑关系的基础上,将弧段分为三类,分别用Ⅰ、Ⅱ、Ⅲ表示,并指出狭长多边形图斑降维综合后的拓扑一致性改正就是保持Ⅰ类弧段不变,Ⅱ类弧段删除,Ⅲ类弧段延长到中心线并相交打断后局部拓扑重建的处理过程；后者在土地利用数据语义综合规则的基础上,对狭长多边形图斑的邻近多边形进行语义一致性改正；最后,给出了狭长多边形图斑自动降维综合的实验流程与实验结果。
5)针对图斑自动化简综合,在详细分析各种约束因素对图斑化简综合产生的影响基础上,将图斑按照所表达的地理要素特征分为自然地物和人造地物两大类,并分析了两类图斑各自的特点以及化简的优先顺序；接着针对人造地物图斑化简综合,在现有基于最小二乘法平差原理的建筑物图斑化简算法基础上,提出了一种适用于土地利用人造地物图斑化简综合且顾及多重约束因素的改进型图斑化简综合算法,该算法先对人造地物的形状结构进行探测,然后对以共享边存在的人造地物图斑进行化简前预处理,最后根据化简综合所需顾及的多重约束条件建立多个约束方程,联立方程组进行最小二乘平差解算得到最终化简结果。针对自然地类图斑化简,指出了拓扑关系、图斑边界弯曲特征和面积平衡保持是自然地类图斑化简时需要重点考虑的约束因素,并根据图斑是否被其它图斑包含,又将自然地类图斑分为岛状图斑和非岛状图斑两种,对于非岛状图斑,提出了一种基于图斑边界弯曲特征分析并顾及多重约束条件的自然地类图斑自动化简方法,该方法先利用CDT对自然地类图斑的共享边界进行弯曲探测和识别,分析其凹凸特性,然后运用渐进式化简综合思想,对共享边界进行凹凸交替式删除化简,使得在化简过程中图斑的面积尽可能的保持了平衡,最后利用夸大或删除部分弯曲来平衡化简积累的面积差,从而得到面积保持平衡的化简结果;对于岛状图斑,先用最小外包矩形对图斑边界实施分割,并对每一段按照非岛状图斑的化简策略实施化简,从而在顾及面积与弯曲特征的约束基础上,很好的顾及了图斑主方向及整体形态约束特征。为了检验图斑自动化简算法的有效性,最后给出了图斑自动化简综合的实验流程与实验结果。
6)针对土地利用数据库制图综合的实际应用需求,进行了原型系统分析与设计,并在MapGIS K9平台上用MS Visual Studio2005进行二次开发,实现了满足土地利用数据库制图综合的原型系统Landuse-Gen:该系统采用工作流的设计思想,将综合过程中所需的源数据、综合算子、综合参量、综合知识、综合规则以及其它所需资源视为综合流程中的—个节点,存放在系统的功能仓库中,制图人员根据项目预先制定的综合操作方案,将综合过程中所涉及的流程节点通过系统提供的流程搭建工具搭建成综合流程,每个流程针对—个特定的综合应用需求,其构建的过程即是制图专家综合决策的体现,因此,每个综合流程在执行时,即被赋予了人的部分知识、经验和决策能力,从而使得系统具备了一定的智能性。为了检验本综合系统的可行性和实用性,详细介绍了以广西铁山港区1：1万土地利用数据为例进行的1：5万的综合试验情况。
Land-use database is a thematic type of digital map databases which is based on a detailed survey of land-use status. It is mainly used for land resource management to reflect the land location, quantity, quality, spatial distribution, land-use type, ownership and use status etc. The same as the general geographic data, land-use data contains spatial data and attribute data, the polygons in the land-use spatial data have the characteristic of covering the entire space region with seamless distribution, and the land-use attribute data are enriched with semantic information and multi-level thematic characteristics. Therefore, land-use database cartographic generalization is different from common map database cartographic generalization, it is the typical application for cartographic generalization theory and technology taking into the field of land-use thematic data, its purpose is to improve the map's readability and understandability. In the process of cartographic generalization, it should consider the regional distribution patterns of sporadic parcels, statistical characteristics, semantics, topology, graphics, precision constraints and other factors according to the application target requirements and mapping regional characteristics, in addition to considering the traditional cartographic theory factors, it needs to generalize systematically in a comprehensively constrained order. Many scholars have done a lot of research on land use data generalization, and made a series of research results, but these studies were mainly, on the one hand, on an interactive generalization for operation lacking of intelligence, and on the other hand, these algorithm usually only took into account a certain constraint or focused on a particular aspect of generalization, due to the difficulty of implementing multiple constraints, which made the result attend to one thing and lose another, and the land-use data generalization is a systematic project, it needs to consider the various constraints. Therefore, neither in theory nor in practical applications, it is meaningful to study on multiple constraints for land use data generalization, and make research on new methods and intelligent system.
This thesis focuses on sporadic parcels of land-use database, examines its rational procedure that should be kept to in the generalization flow, the operation that generalization should be taken, and the constraints that operation should be taken into account. According to the operations' order, polygons'merging generalization, narrow and long polygons'dimension-reducing generalization and polygons'simplifying generalization which are the most common operations for the polygons' generalization are taken into account, studying on the automatically generalizing methods under the control of multiple constraints and building an intelligent land-use database generalizing system, a land-use data generalization experiment is executed from scale1:10000to1:50000, and the generalization results are assessed which is to verify the proposed algorithm whether is effective and rational and the intelligent generalizing system whether is feasible and practical. Specific research works are as follows:
1) The purpose and significance of this research is introduced, then, the general map cartographic generalization research status quo and land-use map generalization research status quo are summarized, the lack of current research on land-use data generalization is pointed out, and the scope of this thesis and the research content are defined.
2) The concept of constraint for cartographic generalization and the impact of constraint on cartographic generalization are introduced. The basic characteristics of land use data that multilayer spatial data organization, to cover the whole region by sporadic parcels and rich semantic information and thematic information are analyzed. The difference between land-use map cartography generalization with common map cartographic generalization is introduced. The systematic knowledge of constraints for land-use database cartographic general ization consist of six aspects, such as scale constraint, structural constraint, spatial relations constraint, semantic constraint, geometric constraint and operation process constraint, and each constraint's meaning and significance is elaborated. Considering the quality controlling and integrity of generalization, several methods for land-use database generalization result assessment are proposed, including area change rate, semantic similarity, structural similarity and distribution stability, which is in order to check whether the results are reasonable, and to ensure generalization quality.
3) As for sporadic parcels automatically merging generalization, what constraints that should be taken into account as well as the order that constraints should take for sporadic parcels merging generalization is analysed, and the merging generalization is divided into three types according to the topological relations between polygons, their are aggregation, consolidation, and amalgamation, each type's meaning and method of operation is given, it points out that the amalgamation operation can be considered a special case of the consolidation operation, and that the aggregation operation should be taken before the consolidation operation. Then, a method for sporadic parcels aggregation generalization is proposed based on raster and vector data model, firstly, it divides the sporadic parcels into several spatial zones and takes cluster analysis base on raster data model, secondly, it aggregates the cluster polygons based on vector data model. The method takes into account the spatial distribution constraint of polygons, semantic constraint, graph structure constraint, precision constraint and other constraints. Another method for sporadic parcels consolidation generalization is proposed based on neighborhood relationship analysis of parcels, in which the measure of neighborhood relation is the key point. A method for measuring the degree of neighborhood considering the topology and semantic constraints is introduced, and on this basis, the order for the terra-type parcels consolidation to take is given. Finally, the experiment flow for sporadic parcels automatically merging generalization and results are presented.
4) As for long and narrow polygon automatic dimension-reducing generalization, the reason that why do the long and narrow polygons need to take dimension-reducing generalization and what inconsistencies would be made by the dimension-reducing generalization is given, the lack of current research is pointed out. An method for detecting long and narrow polygon automatically and an method for segmenting the long and narrow part of polygon automatically witch are all based on CDT is proposed, on this basis, a method for long and narrow polygon automatic dimension-reducing generalization is introduced. Then, focusing on the inconsistency of topology and semantics produced by the dimension-reducing generalization, an approach for the inconsistencies correcting is given separately. The previous is based on the topology between the target polygon and its adjacent polygons, it classifies the arcs into three types, Ⅰ, Ⅱ and Ⅲ, and presents that the topology consistency correcting is keeping the type I arcs, deleting type II arcs, and prolong the type III arcs to the polygon's centerline, then, clips the arcs and rebuild the topology partly, and the latter aims at semantics consistency correcting based on the sematic rules. Finally, the experiment flow for the long and narrow polygon automatic dimension-reducing generalization and results are presented.
5) As for sporadic parcels automatically simplifying generalization, based on the detailed analysis of various constrained factors that impact on the polygons simplification, it divides the sporadic parcels into two major categories that are natural features and man-made features according to the geographic features of polygons' expression, and the characteristics of each type of polygons and simplification priorities are analyzed. In the following, an improved version of least squares adjustment for man-made features simplification algorithm considering multiple constraints is proposed base on the principle of building polygons simplification algorithm, the algorithm first detecting the structure of man-made feature, then pretreating the polygon before taking simplification that whose edges are shared by another polygon, the last, constructing various equations according to the simplification required multiple constraints, and solving the equations under the least-squares adjustment to get the final results. For natural features simplification, it points out that topological relation, the curved character of polygon's boundary and area balance maintain are mainly constraints that natural features simplification should take into account, and it divides the polygons into island polygons and non-island polygons according to whether the polygon is contained by other polygon. For the non-island polygons, an automatically simplifying algorithm is presented base on the curved character of polygon's boundary and considering multiple constraints, it first detecting and identifying the bend character of polygons shared borders base on CDT, and analyzing its convex characteristics, then taking a progressive simplification policy, it deletes the convex bend alternatively to keep the polygon's area balance as possible as it can in the process of simplification, and finally exaggerating or deleting some bend to balance polygon's accumulation area of simplification, getting the result of simplification with polygon's area kept balanced. For the island polygons, first splitting the polygon's boundary with its smallest outsourcing rectangle, then taking the policy of non-island polygon's simplification for each section, thus keeping the polygon's mainly direction and overall structure characteristics well in addition, expect containing the base area balance and bending characteristics constraints. In order to test the effectiveness of automatically simplifying algorithm for polygons, an experimental flow of polygons automatically simplifying generalization and results are presented at last.
6) A prototype system is analyzed and designed based on the actual application requirements for land use database cartographic generalization, and the prototype system called Land use-Gen which meet the land use database cartography is developed on the MapGIS K9platform using MS Visual Studio2005. The system takes a workflow policy design, which takes the required source data, generalization operators, generalization parameters, generalization knowledge, generalization rules and other necessary resources as a flow node in the generalizing process and each node is stored in the system's functional warehouse. The cartographers, according to the pre-established solution of generalizing operation for project, build the generalizing work flow with the referring flow node in the process of generalization using system's providing build tool, and each work flow is for a specific generalizing application requirements, it is a embodiment of cartographic experts decision-making for generalization. Therefore, when each work flow is executed, the generalizing process is endowed with some knowledge, experience and decision-making ability of people, and thus making the system have a certain intelligence. In order to check the system's feasibility and practicality, an experiment conducted with Tie shan gang land use data of Guang xi for generalization from1:10000to1:50000is described in detail.
引文
[1]吴信才.地理信息系统原理与方法(第二版)[M].北京：电子工业出版社,2009.
[2]陈先伟.土地利用数据库综合的结构化模型和算法研究[D].武汉大学,2005.
[3]郭仁忠.空间分析(第二版)[M].北京：高等教育出版社,2001.
[4]王光霞.地图设计与编绘[M].北京：测绘出版社,2011.
[5]祝国瑞,郭礼珍,尹贡白,等.地图设计与编绘[M].武汉：武汉大学出版社,2001.
[6]高俊.地图学四面体——数字化时代地图学的诠释[J].测绘学报.2004(1)：6-11.
[7]尹连旺,李京.GIS中基本要素的无级比例尺数据处理技术研究[J].北京大学学报(自然科学版).1999,35(6)：842-849.
[8]王占昌.无级比例尺GIS中空间属性的自动综合[J].辽宁师范大学学报(自然科学版).2002(2)：144-146.
[9]武芳,王家耀.地图自动综合的协同方法研究[J].测绘通报.2001(8)：24-25.
[10]Nickerson B G, Freeman H. Development of a rule-based system for automatic map generalization[J]. Proceedings of the Second International Symposium on Spatial Data Handling.1986:537-556
[11]艾廷华.城市地图数据库综合的支撑数据模型与方法的研究[D].武汉测绘科技大学,2000.
[12]毋河海.地图信息自动综合基本问题研究[J].武汉测绘科技大学学报.2000,25(5)：377-386.
[13]Ware J M, Jones C B, Thomas N. Automated map generalization with multiple operators: a simulated annealing approach[J]. International Journal of Geographical Information Science.2003,17(8):743-769.
[14]侯璇.基于弹性力学原理的自动综合位移模型[D].解放军信息工程大学,2004.
[15]钱海忠,武芳,谭笑,等.基于ABTM的城市建筑物合并算法[J].中国图象图形学报.2005(10)：1224-1233.
[16]钱海忠,武芳,邓红艳.基于CIRCLE特征变换的点群选取算法[J].测绘科学.2005(3)：83-85.
[17]钱海忠,武芳,王家耀.自动制图综合及过程控制的智能化研究[M].北京：测绘出版社,2012：15-30.
[18]邓红艳.基于保质设计的自动制图综合研究[D].解放军信息工程大学,2006.
[19]邓红艳,武芳,翟仁健,等.面向制图综合质量控制的数据模型——DFQR树[J].测绘学报.2007(2)：237-243.
[20]Edwardes A, Burghardt D, Neun M. Interoperability in map generalization research[C]. in Proceedings of International Symposium on Generalization of Information.2005.
[21]Harrower M, Bloch M. MapShaper. org:A map generalization web service[J]. Computer Graphics and Applications, IEEE.2006,26(4):22-27.
[22]Jones C B, Mark Ware J. Map generalization in the web age[J]. International Journal of Geographical Information Science.2005,19(8):859-870.
[23]杨现坤,崔伟宏.基于数据库综合和SVG的网络制图综合系统研究[J].计算机应用.2009(1)：201-204.
[24]艾廷华,刘耀林.土地利用数据综合中的聚合与融合[J].武汉大学学报(信息科学版).2002(5)：486-492.
[25]Yaolin L. Categorical Database Generalization in GIS[D]. Wageningne University,2002.
[26]高文秀.基于知识的GIS专题数据综合的研究[D].武汉大学,2002.
[27]Bader M, Weibel R. Detecting and resolving size and proximity conflicts in the generalization of polygonal maps[C]. Stockholm, Sweden:Proceedings of the 18th ICC. 1997.
[28]艾廷华,郭仁忠,陈晓东Delaunay三角网支持下的多边形化简与合并[J].中国图象图形学报.2001(7)：93-99.
[29]艾廷华,毋河海.相邻多边形共享边界的一致化改正[J].武汉测绘科技大学学报.2000(5)：426-431.
[30]Schylberg L. Computational methods for generalization of cartographic data in a raster environment [D]. Royal Institute of Technology, Department of Geodesy and Photogrammetry,1993.
[31]Li Z, Su B. Algebraic models for feature displacement in the generalization of digital map data using morphological techniques[J]. Cartographica:The International Journal for Geographic Information and Geovisualization.1995,32(3):39-56.
[32]Su B, Li Z, Lodwick G, et al. Algebraic models for the aggregation of area features based upon morphological operators[J]. International Journal of Geographical Information Science.1997,11(3):233-246.
[33]张青年,秦建新.面状分布地物群识别与概括的数学形态学方法[J].地理研究.2000(1)：93-100.
[34]杨德生,于欢,王学杰,等.土地利用现状数据缩编方法探讨[J].测绘科学.2012(5)：157-159.
[35]戴腾,陈庆.多比例尺土地资源调查专题地图制作方法探究[J].测绘通报.2013(2)：70-72.
[36]Buttenfield B P, Mcmaster R B. Map Generalization:Making rules for knowledge representation[M]. Germany:Longman Scientific & Technical New York,1991:121-135.
[37]Ruas A. A method for building displacement in automated map generalisation[J]. International Journal of Geographical Information Science.1998,12(8):789-803.
[38]Weibel R, Dutton G. Constraint-based automated map generalization[C]. In Proceeding of 8th International Symposium on Spatial Data Handling.1998.
[39]田晶,马盟,杨曦承.基于约束的城市街道网自动综合方法[J].测绘科学.2008(5)：158-160.
[40]余琳琳.基于制图综合约束条件的质量评价[D].解放军信息工程大学,2008.
[41]杨宝尧.基于空间聚合的土地利用数据组织与更新方法研究[D].浙江大学,2012.
[42]陈百明,周小萍.《土地利用现状分类》国家标准的解读[J].自然资源学报.2007,22(6)：994-1003.
[43]Harrie L. Weight-setting and quality assessment in simultaneous graphic generalization[J]. Cartographic Journal, The.2003,40(3):221-233.
[44]Chen Y, Wang Z, Zhang K. Approximations for modulus of gradients and their applications to neighborhood filters [J]. Frontiers of Mathematics in China.2013(4): 761-782.
[45]Galanda M. Automated polygon generalization in a multi agent system[D]. Department of Geography, University of Zurich, Switzerland.2003.
[46]Goodchild M F, Proctor J. Scale in a digital geographic world[J]. Geographical and environmental modelling.1997,1(1):5-24.
[47]Lam N S, Quattrochi D A. On the Issues of Scale, Resolution, and Fractal Analysis in the Mapping Sciences[J]. The Professional Geographer.1992,44(1):88-98.
[48]邬建国.景观生态学：格局、过程、尺度与等级[M].第二版.北京：高等教育出版社,2007.
[49]Danciger J, Devadoss S L, Mugno J, et al. Shape deformation in continuous map generalization[J]. Geoinformatica.2009,13(2):203-221.
[50]Steiniger S, Weibel R. Relations among map objects in cartographic generalization[J]. Cartography and Geographic Information Science.2007,34(3):175-197.
[51]黄远林.地图图形综合指标体系框架与图形结构识别研究[D].武汉大学博士论文,2012.
[52]Egenhofer M, Herring J. Categoring Binary Topological Relationships between Regions, Lines, and Points in Geographic Databases[R]. Department of Surveying Engineering, University of Maine,1991.
[53]邓敏,张燕,李光强.空间方向关系描述模型及其G1S应用分析[J].计算机工程与应用.2008(7)：37-40.
[54]郭庆胜,黄远林.空间推理与渐进式地图综合[M].武汉：武汉大学出版社,2007.
[55]闫浩文.空间方向关系理论研究[M].成都：成都地图出版社,2003.
[56]Mark D M. Spatial representation:a cognitive view[J]. Geographical information systems: principles and applications.1999,1:81-89.
[57]武芳,邓红艳,钱海忠,等.地图自动综合质量评估模型[M].北京：科学出版社,2009.
[58]谷建立.土地利用类型图综合约束控制与质量评估研究[D].华中农业大学,2012.
[59]Sukhov V I. Application of information theory in generalization of map contents[J]. International year book of cartography.1970,10(1):41-47.
[60]邹胜武,邹时林,李大军,等.土地利用图缩编中小图斑综合方法的改进[J].地理空间信息.2013(1)：138-140.
[61]张必胜,李朝奎,周启.空间信息源的多尺度地形图智能化缩编方法与应用[J].地球信息科学学报.2013(2)：217-224.
[62]冀书叶.土地利用现状数据缩编方法探析[J].测绘与空间地理信息.2012(5)： 185-187.
[63]艾廷华,杨帆,李精忠.第二次土地资源调查数据建库中的土地利用图综合缩编[J].武汉大学学报(信息科学版).2010(8)：887-891.
[64]贾小斌,艾廷华.土地利用数据综合中图斑多边形决策推理[J].农业工程学报.2013(9)：214-222.
[65]王振宇.农用地分等汇总制图综合知识规则的建立[D].武汉大学,2005.
[66]刘晓.基于栅格数据的GIS空间分析算法及其软件实现研究[D].西北大学,2005.
[67]常燕卿,刘纪平.GIS中实用化矢量栅格一体化技术实现[J].中国图象图形学报.1998(6)：50-53.
[68]石岩,刘启亮,邓敏,等.一种顾及障碍约束的空间聚类方法[J].武汉大学学报(信息科学版).2012(1)：96-100.
[69]柳盛.吉根林.空间聚类技术研究综述[J].南京师范大学学报(工程技术版).2010(2)：57-62.
[70]孔娟,徐夫田,薛庆峰.基于数学形态学的带障碍约束的空间聚类算法研究[J].电脑知识与技术.2008(36)：2923-2925.
[71]刘庆清,邓羽,张文婷.基于模糊推理的空间聚类方法研究[J].测绘信息与工程.2010(4)：38-39.
[72]郭仁忠,艾廷华.制图综合中建筑物多边形的合并与化简[J].武汉测绘科技大学学报.2000(1)：25-30.
[73]王辉连,武芳,王宝山,等.用于数字地图自动综合的多边形合并算法[J].测绘工程.2005(3)：15-18.
[74]王光霞,杨培.数学形态学在居民地街区合并中的应用[J].测绘学院学报.2000(3)：201-203.
[75]徐伟,华月园,徐研.数学形态学的合并综合算子研究[J].海洋测绘.2012(5)：32-34.
[76]吴亮,谢忠,叶梓.街网约束下的城市居民地自动综合算法[J].地理与地理信息科学.2009(3)：37-41.
[77]郭建忠,谢明霞,李柱林.基于线缓冲区分析的街区合并方法[J].地理与地理信息科学.2011(6)：111-112.
[78]黄继风.基于Delaunay三角网的城市多边形合并算法[J].计算机工程与设计.2004(7)：1220-1222.
[79]叶琳,邱龙辉.多边形合并的算法研究[J].计算机应用与软件.2002(8)：57-59.
[80]袁策,张锦.GIS环境城市居民地合并综合算法研究[J].太原理工大学学报.2005(2)：126-129.
[81]刘耀林,李红梅,杨淳惠.基于本体的土地利用数据综合研究[J].武汉大学学报(信息科学版).2010(8)：883-886.
[82]TD/T 1014-2007第二次全国土地调查技术规程[S].北京,中华人民共和国国土资源部,2007.
[83]黄亚锋,艾廷华,刘鹏程.顾及Gestalt认知效应的线性岛屿模式识别[J].武汉大学学报(信息科学版).2011(6)：717-720.
[84]陈先伟,郭仁忠,闫浩文.土地利用数据库综合中图斑拓扑关系的创建和一致性维 护[J].武汉大学学报(信息科学版).2005(4)：370-373.
[85]武晓波,王世新,肖春生Delaunay三角网的生成算法研究[J].测绘学报.1999(1)：30-37.
[86]Tsai V J. Delaunay triangulations in TIN creation:an overview and a linear-time algorithm[J]. International Journal of Geographical Information Science.1993,7(6): 501-524.
[87]Lingas A. The Greedy and Delaunay Triangulations are not Bad in the Average Case[J]. Information Processing Letters.1986(22):25-31.
[88]Regnauld N. Recognition of building cluster for generalization[C]. In:Kraak M J and Molenaar M(eds):A dvance in GIS Research II (7th Int. Symposium on Spatial Data Handling). London:Taylor&Francis,1997.
[89]Doerschler J S, Freeman H. An expert system for dense-map name placement[C]//Proc. Auto-Carto.1989,9:215-224.
[90]Ware J M, Jones C B. A spatial model for detecting (and resolving) conflict caused by scale reduction[J]. Advances in GIS Research.1996,2:547-558.
[91]Peng W. Automatic generalization in GIS[J]. ITC Publication Series (The Netherlands). 1995.
[92]刘学军,龚健雅.约束数据域的Delaunay三角剖分与修改算法[J].测绘学报.2001(1)：82-88.
[93]吴宇晓,张登荣.生成Delaunay三角网的快速合成算法[J].浙江大学学报(理学版).2004(3)：343-348.
[94]艾廷华,郭仁忠.基于约束Delaunay结构的街道中轴线提取及网络模型建立[J].测绘学报.2000(4)：348-354.
[95]Haunert J H, Sester M. Area collapse and road centerlines based on straight skeletons[J]. Geoinformatica,2008,12(2):169-191.
[96]陈涛,艾廷华.多边形骨架线与形心自动搜寻算法研究[J].武汉大学学报(信息科学版).2004(5)：443-446.
[97]杜世宏,杜道生,樊红,等.基于栅格数据提取主骨架线的新算法[J].武汉测绘科技大学学报.2000(5)：432-436.
[98]田启明,罗予频,胡东成.圆角化的图形区域直骨架及其算法[J].计算机辅助设计与图形学学报.2005(12)：2642-2646.
[99]李精忠,艾廷华.多尺度土地利用数据库构建过程中的拓扑一致性维护[J].测绘通报.2011(8)：32-35.
[100]Bundy G L, B C J, Al E. A Topological Structure for the Generalization of Large Scale Cartographic Data[C]. Innovations in GIS 2.P.F.Fisher(ed),Taylor and Francis.1995.
[101]罗志强,钟尔杰.任意多边形面积公式的推导及其应用[J].大学数学.2005(1)：123-125.
[102]李建林,朱德海,宋晓眉,等.一种基于面积平衡约束的图斑化简算法[J].地理与地理信息科学.2009(1)：103-106.
[103]翟仁健,武芳,朱丽,等.利用地理特征约束进行曲线化简[J].武汉大学学报(信息 科学版).2009(9)：1021-1024.
[104]王辉连.居民地自动综合的智能方法研究[D].中国人民解放军信息工程大学,2005.
[105]王辉连,武芳,张琳琳,等.数学形态学和模式识别在建筑物多边形化简中的应用[J].测绘学报.2005(3)：269-276.
[106]艾廷华,郭仁忠.支持地图综合的面状目标约束Delaunay三角网剖分[J].武汉测绘科技大学学报.2000(1)：35-41.
[107]郭庆胜.以直角方式转折的面状要素图形简化方法[J].武汉测绘科技大学学报.1999(3)：255-258.
[108]Sester M. Generalization based on least squares adjustment[C]. Amsterdam:International Archives of Photogrammetry And Remote Sensing.2000:931-938
[109]於宗焘,鲁成林.测量平差基础[M].北京：测绘出版社,1994：35-50.
[110]於宗焘,于正林.测量平差原理[M].武汉测绘科技大学出版社,1989.
[111]刘鹏程,艾廷华,邓吉芳.基于最小二乘的建筑物多边形的化简与直角化[J].中国矿业大学学报.2008(5)：699-704.
[112]袁策.基于最小二乘平差理论的空间目标自动综合算法和应用研究[D].太原理工大学,2005.
[113]童小华.GIS数据误差处理与质量控制理论与方法[D].武汉大学,2003.
[114]Zhilin L, Openshaw S. Algorithms for line generalization based on natural objective principles[J]. International journal of Geographic information systems.1992,6(5): 373-389.
[115]毋河海.数字曲线拐点的自动确定[J].武汉大学学报(信息科学版).2003(3)：330-335.
[116]应申.曲线的一致性化简及曲线相交的研究[D].武汉大学,2002.
[117]Mcmaster R B.A statistical analysis of mathematical measures for linear simplification[J]. The American Cartographer.1986,13(2):103-116.
[118]王家耀等.普通地图制图综合原理[M].测绘出版社,1992.
[119]Wang Z, Muller J C. Line generalization based on analysis of shape characteristics[J]. Cartography and Geographic Information Systems,1998,25(1):3-15.
[120]Mcmaster R B. Automated line generalization[J]. Cartographica:The International Journal for Geographic Information and Geovisualization.1987,24(2):74-111.
[121]Douglas D H, Peucker T K. Algorithms for the Reduction of the Number of Points Required to Represent a Line or its Caricature[J]. The Canadian Cartographer.1973, 10(2):112-122.
[122]Visvalingam M, Whyatt J. Line Generalization by Repeated Elimination of Points[J]. Cartographic Journal.1993,30(1):46-51.
[123]Visvalingam M, Williamson P J. Simplification and generalization of large scale data for roads:a comparison of two filtering algorithms[J]. Cartography and Geographic Information Systems.1995,22(4):264-275.
[124]Dutton G. Scale, sinuosity, and point selection in digital line generalization[J]. Cartography and Geographic Information Science.1999,26(1):33-54.
[125]Plazanet C, Affholder J, Fritsch E. The importance of geometric modeling in linear feature generalization[J]. Cartography and Geographic Information Systems.1995,22(4): 291-305.
[126]Poorten P V D, Jones C B. Characterisation and generalisation of cartographic lines using Delaunay triangulation[J]. International Journal of Geographical Information Science. 2002,16(8):773-794.
[127]翟仁健,武芳,朱丽,等.曲线形态的结构化表达[J].测绘学报.2009(2)：175-182.
[128]艾廷华,郭仁忠,刘耀林.曲线弯曲深度层次结构的二叉树表达[J].测绘学报.2001(4)：343-348.
[129]郭庆胜.地图自动综合理论与方法[M].测绘出版社,2002.
[130]程鹏飞,闫浩文,韩振辉.一个求解多边形最小面积外接矩形的算法[J].工程图学学报.2008(1)：122-126.
[131]朱鲲鹏,武芳,陈波,等.基于约束条件的线要素化简算法质量评估[J].测绘科学.2007(3)：28-30.
[2]陈先伟.土地利用数据库综合的结构化模型和算法研究[D].武汉大学,2005.
[3]郭仁忠.空间分析(第二版)[M].北京：高等教育出版社,2001.
[4]王光霞.地图设计与编绘[M].北京：测绘出版社,2011.
[5]祝国瑞,郭礼珍,尹贡白,等.地图设计与编绘[M].武汉：武汉大学出版社,2001.
[6]高俊.地图学四面体——数字化时代地图学的诠释[J].测绘学报.2004(1)：6-11.
[7]尹连旺,李京.GIS中基本要素的无级比例尺数据处理技术研究[J].北京大学学报(自然科学版).1999,35(6)：842-849.
[8]王占昌.无级比例尺GIS中空间属性的自动综合[J].辽宁师范大学学报(自然科学版).2002(2)：144-146.
[9]武芳,王家耀.地图自动综合的协同方法研究[J].测绘通报.2001(8)：24-25.
[10]Nickerson B G, Freeman H. Development of a rule-based system for automatic map generalization[J]. Proceedings of the Second International Symposium on Spatial Data Handling.1986:537-556
[11]艾廷华.城市地图数据库综合的支撑数据模型与方法的研究[D].武汉测绘科技大学,2000.
[12]毋河海.地图信息自动综合基本问题研究[J].武汉测绘科技大学学报.2000,25(5)：377-386.
[13]Ware J M, Jones C B, Thomas N. Automated map generalization with multiple operators: a simulated annealing approach[J]. International Journal of Geographical Information Science.2003,17(8):743-769.
[14]侯璇.基于弹性力学原理的自动综合位移模型[D].解放军信息工程大学,2004.
[15]钱海忠,武芳,谭笑,等.基于ABTM的城市建筑物合并算法[J].中国图象图形学报.2005(10)：1224-1233.
[16]钱海忠,武芳,邓红艳.基于CIRCLE特征变换的点群选取算法[J].测绘科学.2005(3)：83-85.
[17]钱海忠,武芳,王家耀.自动制图综合及过程控制的智能化研究[M].北京：测绘出版社,2012：15-30.
[18]邓红艳.基于保质设计的自动制图综合研究[D].解放军信息工程大学,2006.
[19]邓红艳,武芳,翟仁健,等.面向制图综合质量控制的数据模型——DFQR树[J].测绘学报.2007(2)：237-243.
[20]Edwardes A, Burghardt D, Neun M. Interoperability in map generalization research[C]. in Proceedings of International Symposium on Generalization of Information.2005.
[21]Harrower M, Bloch M. MapShaper. org:A map generalization web service[J]. Computer Graphics and Applications, IEEE.2006,26(4):22-27.
[22]Jones C B, Mark Ware J. Map generalization in the web age[J]. International Journal of Geographical Information Science.2005,19(8):859-870.
[23]杨现坤,崔伟宏.基于数据库综合和SVG的网络制图综合系统研究[J].计算机应用.2009(1)：201-204.
[24]艾廷华,刘耀林.土地利用数据综合中的聚合与融合[J].武汉大学学报(信息科学版).2002(5)：486-492.
[25]Yaolin L. Categorical Database Generalization in GIS[D]. Wageningne University,2002.
[26]高文秀.基于知识的GIS专题数据综合的研究[D].武汉大学,2002.
[27]Bader M, Weibel R. Detecting and resolving size and proximity conflicts in the generalization of polygonal maps[C]. Stockholm, Sweden:Proceedings of the 18th ICC. 1997.
[28]艾廷华,郭仁忠,陈晓东Delaunay三角网支持下的多边形化简与合并[J].中国图象图形学报.2001(7)：93-99.
[29]艾廷华,毋河海.相邻多边形共享边界的一致化改正[J].武汉测绘科技大学学报.2000(5)：426-431.
[30]Schylberg L. Computational methods for generalization of cartographic data in a raster environment [D]. Royal Institute of Technology, Department of Geodesy and Photogrammetry,1993.
[31]Li Z, Su B. Algebraic models for feature displacement in the generalization of digital map data using morphological techniques[J]. Cartographica:The International Journal for Geographic Information and Geovisualization.1995,32(3):39-56.
[32]Su B, Li Z, Lodwick G, et al. Algebraic models for the aggregation of area features based upon morphological operators[J]. International Journal of Geographical Information Science.1997,11(3):233-246.
[33]张青年,秦建新.面状分布地物群识别与概括的数学形态学方法[J].地理研究.2000(1)：93-100.
[34]杨德生,于欢,王学杰,等.土地利用现状数据缩编方法探讨[J].测绘科学.2012(5)：157-159.
[35]戴腾,陈庆.多比例尺土地资源调查专题地图制作方法探究[J].测绘通报.2013(2)：70-72.
[36]Buttenfield B P, Mcmaster R B. Map Generalization:Making rules for knowledge representation[M]. Germany:Longman Scientific & Technical New York,1991:121-135.
[37]Ruas A. A method for building displacement in automated map generalisation[J]. International Journal of Geographical Information Science.1998,12(8):789-803.
[38]Weibel R, Dutton G. Constraint-based automated map generalization[C]. In Proceeding of 8th International Symposium on Spatial Data Handling.1998.
[39]田晶,马盟,杨曦承.基于约束的城市街道网自动综合方法[J].测绘科学.2008(5)：158-160.
[40]余琳琳.基于制图综合约束条件的质量评价[D].解放军信息工程大学,2008.
[41]杨宝尧.基于空间聚合的土地利用数据组织与更新方法研究[D].浙江大学,2012.
[42]陈百明,周小萍.《土地利用现状分类》国家标准的解读[J].自然资源学报.2007,22(6)：994-1003.
[43]Harrie L. Weight-setting and quality assessment in simultaneous graphic generalization[J]. Cartographic Journal, The.2003,40(3):221-233.
[44]Chen Y, Wang Z, Zhang K. Approximations for modulus of gradients and their applications to neighborhood filters [J]. Frontiers of Mathematics in China.2013(4): 761-782.
[45]Galanda M. Automated polygon generalization in a multi agent system[D]. Department of Geography, University of Zurich, Switzerland.2003.
[46]Goodchild M F, Proctor J. Scale in a digital geographic world[J]. Geographical and environmental modelling.1997,1(1):5-24.
[47]Lam N S, Quattrochi D A. On the Issues of Scale, Resolution, and Fractal Analysis in the Mapping Sciences[J]. The Professional Geographer.1992,44(1):88-98.
[48]邬建国.景观生态学：格局、过程、尺度与等级[M].第二版.北京：高等教育出版社,2007.
[49]Danciger J, Devadoss S L, Mugno J, et al. Shape deformation in continuous map generalization[J]. Geoinformatica.2009,13(2):203-221.
[50]Steiniger S, Weibel R. Relations among map objects in cartographic generalization[J]. Cartography and Geographic Information Science.2007,34(3):175-197.
[51]黄远林.地图图形综合指标体系框架与图形结构识别研究[D].武汉大学博士论文,2012.
[52]Egenhofer M, Herring J. Categoring Binary Topological Relationships between Regions, Lines, and Points in Geographic Databases[R]. Department of Surveying Engineering, University of Maine,1991.
[53]邓敏,张燕,李光强.空间方向关系描述模型及其G1S应用分析[J].计算机工程与应用.2008(7)：37-40.
[54]郭庆胜,黄远林.空间推理与渐进式地图综合[M].武汉：武汉大学出版社,2007.
[55]闫浩文.空间方向关系理论研究[M].成都：成都地图出版社,2003.
[56]Mark D M. Spatial representation:a cognitive view[J]. Geographical information systems: principles and applications.1999,1:81-89.
[57]武芳,邓红艳,钱海忠,等.地图自动综合质量评估模型[M].北京：科学出版社,2009.
[58]谷建立.土地利用类型图综合约束控制与质量评估研究[D].华中农业大学,2012.
[59]Sukhov V I. Application of information theory in generalization of map contents[J]. International year book of cartography.1970,10(1):41-47.
[60]邹胜武,邹时林,李大军,等.土地利用图缩编中小图斑综合方法的改进[J].地理空间信息.2013(1)：138-140.
[61]张必胜,李朝奎,周启.空间信息源的多尺度地形图智能化缩编方法与应用[J].地球信息科学学报.2013(2)：217-224.
[62]冀书叶.土地利用现状数据缩编方法探析[J].测绘与空间地理信息.2012(5)： 185-187.
[63]艾廷华,杨帆,李精忠.第二次土地资源调查数据建库中的土地利用图综合缩编[J].武汉大学学报(信息科学版).2010(8)：887-891.
[64]贾小斌,艾廷华.土地利用数据综合中图斑多边形决策推理[J].农业工程学报.2013(9)：214-222.
[65]王振宇.农用地分等汇总制图综合知识规则的建立[D].武汉大学,2005.
[66]刘晓.基于栅格数据的GIS空间分析算法及其软件实现研究[D].西北大学,2005.
[67]常燕卿,刘纪平.GIS中实用化矢量栅格一体化技术实现[J].中国图象图形学报.1998(6)：50-53.
[68]石岩,刘启亮,邓敏,等.一种顾及障碍约束的空间聚类方法[J].武汉大学学报(信息科学版).2012(1)：96-100.
[69]柳盛.吉根林.空间聚类技术研究综述[J].南京师范大学学报(工程技术版).2010(2)：57-62.
[70]孔娟,徐夫田,薛庆峰.基于数学形态学的带障碍约束的空间聚类算法研究[J].电脑知识与技术.2008(36)：2923-2925.
[71]刘庆清,邓羽,张文婷.基于模糊推理的空间聚类方法研究[J].测绘信息与工程.2010(4)：38-39.
[72]郭仁忠,艾廷华.制图综合中建筑物多边形的合并与化简[J].武汉测绘科技大学学报.2000(1)：25-30.
[73]王辉连,武芳,王宝山,等.用于数字地图自动综合的多边形合并算法[J].测绘工程.2005(3)：15-18.
[74]王光霞,杨培.数学形态学在居民地街区合并中的应用[J].测绘学院学报.2000(3)：201-203.
[75]徐伟,华月园,徐研.数学形态学的合并综合算子研究[J].海洋测绘.2012(5)：32-34.
[76]吴亮,谢忠,叶梓.街网约束下的城市居民地自动综合算法[J].地理与地理信息科学.2009(3)：37-41.
[77]郭建忠,谢明霞,李柱林.基于线缓冲区分析的街区合并方法[J].地理与地理信息科学.2011(6)：111-112.
[78]黄继风.基于Delaunay三角网的城市多边形合并算法[J].计算机工程与设计.2004(7)：1220-1222.
[79]叶琳,邱龙辉.多边形合并的算法研究[J].计算机应用与软件.2002(8)：57-59.
[80]袁策,张锦.GIS环境城市居民地合并综合算法研究[J].太原理工大学学报.2005(2)：126-129.
[81]刘耀林,李红梅,杨淳惠.基于本体的土地利用数据综合研究[J].武汉大学学报(信息科学版).2010(8)：883-886.
[82]TD/T 1014-2007第二次全国土地调查技术规程[S].北京,中华人民共和国国土资源部,2007.
[83]黄亚锋,艾廷华,刘鹏程.顾及Gestalt认知效应的线性岛屿模式识别[J].武汉大学学报(信息科学版).2011(6)：717-720.
[84]陈先伟,郭仁忠,闫浩文.土地利用数据库综合中图斑拓扑关系的创建和一致性维 护[J].武汉大学学报(信息科学版).2005(4)：370-373.
[85]武晓波,王世新,肖春生Delaunay三角网的生成算法研究[J].测绘学报.1999(1)：30-37.
[86]Tsai V J. Delaunay triangulations in TIN creation:an overview and a linear-time algorithm[J]. International Journal of Geographical Information Science.1993,7(6): 501-524.
[87]Lingas A. The Greedy and Delaunay Triangulations are not Bad in the Average Case[J]. Information Processing Letters.1986(22):25-31.
[88]Regnauld N. Recognition of building cluster for generalization[C]. In:Kraak M J and Molenaar M(eds):A dvance in GIS Research II (7th Int. Symposium on Spatial Data Handling). London:Taylor&Francis,1997.
[89]Doerschler J S, Freeman H. An expert system for dense-map name placement[C]//Proc. Auto-Carto.1989,9:215-224.
[90]Ware J M, Jones C B. A spatial model for detecting (and resolving) conflict caused by scale reduction[J]. Advances in GIS Research.1996,2:547-558.
[91]Peng W. Automatic generalization in GIS[J]. ITC Publication Series (The Netherlands). 1995.
[92]刘学军,龚健雅.约束数据域的Delaunay三角剖分与修改算法[J].测绘学报.2001(1)：82-88.
[93]吴宇晓,张登荣.生成Delaunay三角网的快速合成算法[J].浙江大学学报(理学版).2004(3)：343-348.
[94]艾廷华,郭仁忠.基于约束Delaunay结构的街道中轴线提取及网络模型建立[J].测绘学报.2000(4)：348-354.
[95]Haunert J H, Sester M. Area collapse and road centerlines based on straight skeletons[J]. Geoinformatica,2008,12(2):169-191.
[96]陈涛,艾廷华.多边形骨架线与形心自动搜寻算法研究[J].武汉大学学报(信息科学版).2004(5)：443-446.
[97]杜世宏,杜道生,樊红,等.基于栅格数据提取主骨架线的新算法[J].武汉测绘科技大学学报.2000(5)：432-436.
[98]田启明,罗予频,胡东成.圆角化的图形区域直骨架及其算法[J].计算机辅助设计与图形学学报.2005(12)：2642-2646.
[99]李精忠,艾廷华.多尺度土地利用数据库构建过程中的拓扑一致性维护[J].测绘通报.2011(8)：32-35.
[100]Bundy G L, B C J, Al E. A Topological Structure for the Generalization of Large Scale Cartographic Data[C]. Innovations in GIS 2.P.F.Fisher(ed),Taylor and Francis.1995.
[101]罗志强,钟尔杰.任意多边形面积公式的推导及其应用[J].大学数学.2005(1)：123-125.
[102]李建林,朱德海,宋晓眉,等.一种基于面积平衡约束的图斑化简算法[J].地理与地理信息科学.2009(1)：103-106.
[103]翟仁健,武芳,朱丽,等.利用地理特征约束进行曲线化简[J].武汉大学学报(信息 科学版).2009(9)：1021-1024.
[104]王辉连.居民地自动综合的智能方法研究[D].中国人民解放军信息工程大学,2005.
[105]王辉连,武芳,张琳琳,等.数学形态学和模式识别在建筑物多边形化简中的应用[J].测绘学报.2005(3)：269-276.
[106]艾廷华,郭仁忠.支持地图综合的面状目标约束Delaunay三角网剖分[J].武汉测绘科技大学学报.2000(1)：35-41.
[107]郭庆胜.以直角方式转折的面状要素图形简化方法[J].武汉测绘科技大学学报.1999(3)：255-258.
[108]Sester M. Generalization based on least squares adjustment[C]. Amsterdam:International Archives of Photogrammetry And Remote Sensing.2000:931-938
[109]於宗焘,鲁成林.测量平差基础[M].北京：测绘出版社,1994：35-50.
[110]於宗焘,于正林.测量平差原理[M].武汉测绘科技大学出版社,1989.
[111]刘鹏程,艾廷华,邓吉芳.基于最小二乘的建筑物多边形的化简与直角化[J].中国矿业大学学报.2008(5)：699-704.
[112]袁策.基于最小二乘平差理论的空间目标自动综合算法和应用研究[D].太原理工大学,2005.
[113]童小华.GIS数据误差处理与质量控制理论与方法[D].武汉大学,2003.
[114]Zhilin L, Openshaw S. Algorithms for line generalization based on natural objective principles[J]. International journal of Geographic information systems.1992,6(5): 373-389.
[115]毋河海.数字曲线拐点的自动确定[J].武汉大学学报(信息科学版).2003(3)：330-335.
[116]应申.曲线的一致性化简及曲线相交的研究[D].武汉大学,2002.
[117]Mcmaster R B.A statistical analysis of mathematical measures for linear simplification[J]. The American Cartographer.1986,13(2):103-116.
[118]王家耀等.普通地图制图综合原理[M].测绘出版社,1992.
[119]Wang Z, Muller J C. Line generalization based on analysis of shape characteristics[J]. Cartography and Geographic Information Systems,1998,25(1):3-15.
[120]Mcmaster R B. Automated line generalization[J]. Cartographica:The International Journal for Geographic Information and Geovisualization.1987,24(2):74-111.
[121]Douglas D H, Peucker T K. Algorithms for the Reduction of the Number of Points Required to Represent a Line or its Caricature[J]. The Canadian Cartographer.1973, 10(2):112-122.
[122]Visvalingam M, Whyatt J. Line Generalization by Repeated Elimination of Points[J]. Cartographic Journal.1993,30(1):46-51.
[123]Visvalingam M, Williamson P J. Simplification and generalization of large scale data for roads:a comparison of two filtering algorithms[J]. Cartography and Geographic Information Systems.1995,22(4):264-275.
[124]Dutton G. Scale, sinuosity, and point selection in digital line generalization[J]. Cartography and Geographic Information Science.1999,26(1):33-54.
[125]Plazanet C, Affholder J, Fritsch E. The importance of geometric modeling in linear feature generalization[J]. Cartography and Geographic Information Systems.1995,22(4): 291-305.
[126]Poorten P V D, Jones C B. Characterisation and generalisation of cartographic lines using Delaunay triangulation[J]. International Journal of Geographical Information Science. 2002,16(8):773-794.
[127]翟仁健,武芳,朱丽,等.曲线形态的结构化表达[J].测绘学报.2009(2)：175-182.
[128]艾廷华,郭仁忠,刘耀林.曲线弯曲深度层次结构的二叉树表达[J].测绘学报.2001(4)：343-348.
[129]郭庆胜.地图自动综合理论与方法[M].测绘出版社,2002.
[130]程鹏飞,闫浩文,韩振辉.一个求解多边形最小面积外接矩形的算法[J].工程图学学报.2008(1)：122-126.
[131]朱鲲鹏,武芳,陈波,等.基于约束条件的线要素化简算法质量评估[J].测绘科学.2007(3)：28-30.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |