计算几何在地图综合中的应用

Applications of computational geometry in Map generalization

地图综合是计算几何中的一个应用问题。计算几何是有效的几何基本规则和算法,为地图目标间的复杂空间关系提供了强大的描述和分析依据。文章讨论地图综合中的条件和要求,尤其提出了比例尺缩小造成地不可感知性,而引起选取、目标拥挤、化简和符号化带来的相交等三个关键问题。根据计算几何的Voronoi、Delaunay等数据结构,简要探讨了目标选择、目标聚类和一致性化简的方法。

Cartographic generalization is an open problem in computational geometry (CG).Rules and algorithms in CG provide robust description and analysis approaches for spatial relationships among objects.This paper discusses the requirement of cartographic generalization:object selection because of imperceptibility,spatial feature congestion,coalescence resulted of scale down and intersection in generalization.The paper develops some approaches to selection,cluster and consistence simplification based on the data structure of Voronoi and Delaunay in CG.