%0 Journal Article
%T The Algorithm for Merging City Buildings Based on ABTM<br>基于ABTM的城市建筑物合并算法
%A QIAN Hai-zhong
%A WU Fang
%A TAN Xiao
%A DENG Hong-Yan
%A QIAN Hai-zhong
%A WU Fang
%A TAN Xiao
%A DENG Hong-Yan
%A QIAN Hai-zhong
%A WU Fang
%A TAN Xiao
%A DENG Hong-Yan
%A QIAN Hai-zhong
%A WU Fang
%A TAN Xiao
%A DENG Hong-Yan
%A <br>钱海忠
%A 武芳
%A 谭笑
%A 邓红艳
%J 中国图象图形学报
%D 2005
%I 
%X The city-building merging algorithm is important in automated generalization of large-scale map.After discussing the shortcomings of current algorithms,a new method based on the technique of agent,TIN and clustering is put forward,which is expected to improve the operation speed,intelligentized and roboticized level of generalization.First,a clustering analysis with map data is done in order to divide whole data into several parts.Second,this algorithm regards Delaunay triangle as its basic technology,and takes a new classifying criterion to it.Third,based on the TIN classifying,an agent layer is expressed.And for every different agent layers,different agent life cycles and data structures are defined.Finally,as the final goal,a new algorithm is evolved from the techniques of agent,TIN technique of graphics calculation,and the map generalization constrains.An example and relevant analysis are presented in the end.The result shows that this algorithm is more excellent than others not only in functions but also in the speed,intelligence and automatization level.On the other hand,some modification to the algorithm is discussed.
%K map generalization
%K clustering analysis
%K merge
%K Delaunay triangulation
%K Agent<br>地图综合
%K 聚类分析
%K 合并
%K Delaunay三角形
%K Agent
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D06194629680C940ACE75262F54B9D85&aid=802FD2685D99B345&yid=2DD7160C83D0ACED&vid=F3090AE9B60B7ED1&iid=F3090AE9B60B7ED1&sid=3819B8B7C1B72552&eid=603BC00D7DC5FEAC&journal_id=1006-8961&journal_name=中国图象图形学报&referenced_num=2&reference_num=10