摘要
介绍了一种城市地图中基于建筑物矩形几何特征的多边形全自动综合算法。采用Delaunay三角网探测多边形之间的拓扑邻近关系,根据视觉邻近关系聚合多边形。采用基于分割栅格多次扫描的方法对建筑物多边形进行化简以及形状优化。
This paper discusses the algorithm of building polygon automatic generalization and takes into account the orthogonal characteristics of urban building. It uses Delaunay TIN to detect polygons' topological neighbor relation, and divides thesm into different visual neighbor relation groups by their minimal distance. As for the simplification of building shape,a new method based on grid multi-scan is used to simplify and optimize the building shape.
出处
《计算机工程》
CAS
CSCD
北大核心
2003年第1期204-205,共2页
Computer Engineering
关键词
优化
建筑物多边形
多边形合并
多边形化简
建筑工程制图
Automatic map generalization
Building polygon
Polygon aggregation
Polygon simplification
Grid
Delaunay TIN