首页 | 本学科首页   官方微博 | 高级检索  
     检索      

地图汉字注记的自动定位研究
引用本文:陈孔哲,朱欣焰,张银洲,苏光奎.地图汉字注记的自动定位研究[J].武汉大学学报(信息科学版),1997(2).
作者姓名:陈孔哲  朱欣焰  张银洲  苏光奎
作者单位:武汉测绘科技大学信息工程学院
基金项目:国家科委“八五”科技攻关资助
摘    要:注记是地图的重要组成部分,注记位置、方向选择恰当与否,与地图的易读性和使用价值有密切关系,注记速度也影响着地图的成图周期。可是注记效果不理想,注记速度慢却是计算机制图中的常见现象,即使是在计算机制图技术有了很大发展的今天,自动注记仍然没有得到很好解决。最近的研究表明,找到具有最佳效果的注记从时间上来讲是不可能的,因而自动注记算法都是希望在尽量短的时间内,得到尽可能好的注记效果。自动注记的主要难点在于自动定位。本文针对不同的地图要素,提出了基于回溯的自动定位算法,取得了较好的效果

关 键 词:自动定位  NP-难度问题  目标函数  回溯

Study on Automatic Chinese Label Placement
Cheng Kongzhe,Zhu Xinyan,Zhang Yinzhou,Su Guangkui.Study on Automatic Chinese Label Placement[J].Geomatics and Information Science of Wuhan University,1997(2).
Authors:Cheng Kongzhe  Zhu Xinyan  Zhang Yinzhou  Su Guangkui
Abstract:Labels are an important ingredient in map. Whether labels are in place or not it plays an important role on the readability and usefulness of a map. However, in computer cartography, it is common knowledge that the labeling effect and speed are not ideal yet. Today, even though some other areas of computer cartography have been greatly improved, the automatic label placement is still a great problem. So more researches should be put into label placement. But recent mathematical analysis of cartographic label placement task has shown that finding optimal labeling is prohibitive due to the inherent computational complexity of the problem. This result implies that seeking an efficient algorithm for optimal label placement is a hopeless task. What we can do is to find near optimal labelings in a reasonable time. This paper provides an optimal labeling algorithm based on backtracking,the algorithm has been put into practice and gotten better effect than some other optimal labeling algorithms.
Keywords:automatic label placement  NP  hard problem  objective function  backtracking  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号