检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:许文帅[1] 龙毅[1] 周侗[1,2] 陈林[1]
机构地区:[1]南京师范大学虚拟地理环境教育部重点实验室,江苏南京210023 [2]南通大学地理科学学院,江苏南通226007
出 处:《测绘学报》2013年第6期929-936,共8页Acta Geodaetica et Cartographica Sinica
基 金:国家自然科学基金(41171350;41271449;41301514);高等学校博士点基金(20103207110012);江苏省高校自然科学研究项目(13KJB170020)
摘 要:对早期的局部线化简算法进行拓展和改善,提出一种以建筑物多边形上邻近四点组合为基本处理单元,以最小可视长度阈值为综合指标,通过对其凹凸结构的类型判别及区别处理,实现建筑物多边形快速化简的方法。将线化简中对三点或多点进行局部处理拓展为邻近四点,较好地保持了建筑物形态特征;有针对性地采取全局检查消除自相交现象,并探讨了起始点的选择问题。选取1∶10 000居民地数据进行多组地图综合试验,结果表明该方法可有效地保持多边形的轮廓特征与面积大小。A fast approach is presented to simplify building polygons which extends and improves early line simplification algorithms based on local processing. It takes continuous adjacent four points as the basic unit and minimum visible length threshold under the target scale as generalization parameter considering the right-angled formation and area of buildings to be kept. Definitions of the structure of different adjacent four-point combinations, namely, Z-structure and U-structure, and ways to distinguish and processing them are proposed. Through selecting a start point, taking serial neighboring four points from a building polygon continually, simply discriminating their structural feature and displacing or deleting some of them, this method preliminarily completes the simplification of the building polygon when all different four-point groups of it have been simplified. Then whole examination is taken to solve the problem of self-intersection. Finally several simplification experiments are conducted to discuss the selection scheme of the start point and test the feasibility of the method, which turns out to be satisfying.
关 键 词:地图综合 建筑物多边形化简 邻近四点法 结构判别 最小可视长度阈值
分 类 号:P208[天文地球—地图制图学与地理信息工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200