%0 Journal Article
%T A Novel of Contour Line Simplification Algorithm Base on Visibility<br>基于通视性原理的等高线化简算法研究
%A ZHU Qiang
%A WU Fang
%A ZHAI Renjian
%A <br>朱 强
%A 武 芳
%A 翟仁健
%J 中国图象图形学报
%D 2009
%I 
%X It is important but difficult to generalize contour lines in cartographic generalization domain all along, and the graphic simplification of which is also a necessary difficulty. At present, existent simplification method of contour lines is mainly a geometrical approach, whose results after generalization process can hardly keep the primary shape characteristics. Based on analysis of area dividing and bend nesting of curve by the furthest visibility condition, a new generalization method of contour lines is proposed firstly. The experiment results show that the method is better than Douglas-Peucker algorithms on eliminating self-intersection, keeping character points, and can keep the shape after simplification better.
%K visibility
%K bend nesting
%K contour lines
%K automated generalization
%K simplification<br>通视性
%K 弯曲嵌套
%K 等高线
%K 自动综合
%K 化简
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D06194629680C940ACE75262F54B9D85&aid=9B01E53A47EEAAA558BD14B81A4BB3B9&yid=DE12191FBD62783C&vid=F3583C8E78166B9E&iid=0B39A22176CE99FB&sid=3356A7630A93A219&eid=F7496043B4F12D75&journal_id=1006-8961&journal_name=中国图象图形学报&referenced_num=0&reference_num=10