24小时热门版块排行榜    

查看: 777  |  回复: 3
【奖励】 本帖被评价2次,作者yanggis增加金币 2

yanggis

木虫 (著名写手)


[资源] 【分享】分析制图综合的一篇国外博士论文

名称:Energy Minimization Methods for Feature Displacement in Map Generalizaion
纳米盘下载链接
http://d.namipan.com/d/c099b4a6c ... 9104e02c0a03ffd5200
论文的摘要信息
The work reported in this thesis considers the issue of feature displacement in cartographic
generalization. Attempts to display cartographic data at scales smaller
than the source scale result in spatial con
icts; map symbols clutter or overlap.
Several map generalization operators may be applied to resolve these problems,
including displacement. The main goal of displacement is to separate con
icting
objects, either by deformation of their outline or by shifting them in their entirety.
Cartographic displacement is a contextual operation, dealing with several objects
at once, and also a ecting the neighborhood of the con
icting features. Local
reasoning often fails, since con
icts are not solved, but simply pushed back and
forth. Existing sequential displacement algorithms fail to incorporate the required
broader view necessary for successful generalization.
This thesis proposes new techniques to handle displacement. Instead of working
through all proximity con
icts one after the other, as executed by sequential methods,
a global approach is adopted. Here, cartographic displacement is interpreted
as an optimization problem. The proposed models thereby rely on an interplay of
external and internal forces which compete a solution. Internal regularizing forces
constrain the displacement of map objects or object structures, while at the same
time proximity con
icts give rise to external forces, which try to deform objects
and push them away from con
icts. A balance between internal and external forces
is iteratively sought { the system energy is minimized.
For the modeling of regularizing structures, this research draws upon techniques
used in engineering sciences. In the thesis, care is taken to illustrate the background
and theory of these techniques for geographers who are perhaps less familiar with
this subject. A goal of this study is to adapt these techniques to demands arising
in cartography. The success of the new algorithms depends on the way in which
cartographic constraints and cartographic knowledge can be translated into the
numerical methods.
Three algorithms are proposed. First, the use of snakes { a widespread technique
in computer vision { is investigated for the cartographic displacement of
roads. This technique o ers a promising way to constrain road shapes and to reach
a good displacement solution iteratively. It is described how snakes can be set up to
allow the cushioning of displacement through line networks, which frees roads from
the rigid restriction of xed junction nodes. Further, the importance of junctions
is pointed out for the displacement operation. It is shown how formerly computed
local modi cations of the junction geometry can be incorporated into the iterative
process.
A second algorithm for road displacement makes use of elastic beams, a concept
originally developed in structural mechanics. Beams prove to be better suited for
road displacement than snakes, since they provide a control of road directions and
o er an interface over which a cartographic behavior can be carried over on the
roads; bending and stretching of road segments can be controlled explicitly.
Finally, the work addresses building displacement in urban blocks. Even though
the constraints guiding this class of displacement vary from the ones handled in
road displacement, a tool from structural mechanics again provides useful input.
The structure of buildings is interpreted as ductile truss, wherein characteristic
object relations can be controlled and preserved.
回复此楼
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

geowji

木虫 (正式写手)


★★★★★ 五星级,优秀推荐

下载下来好好看看
3楼2010-05-12 12:43:53
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
简单回复
seacliff2楼
2010-05-12 11:19   回复  
 
2010-05-14 20:02   回复  
 谢谢分享
相关版块跳转 我要订阅楼主 yanggis 的主题更新
☆ 无星级 ★ 一星级 ★★★ 三星级 ★★★★★ 五星级
普通表情 高级回复 (可上传附件)
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[基金申请] 系统查不到 +11 董八千 2026-08-26 11/550 2026-08-28 18:06 by Leogzhya
[基金申请] 投票:  有多少人是今天查系统知道结果的? +16 爱看书的可乐 2026-08-26 18/900 2026-08-28 17:09 by winsaint
[基金申请] 有没有仍没收到信息的 +3 德尚中行 2026-08-27 3/150 2026-08-28 15:24 by rongshuxia
[教师之家] 导师吐槽:我怎么摊上了这么个极品研究生! +8 苏东坡二世 2026-08-23 8/400 2026-08-28 14:41 by lkforward
[基金申请] 麻烦专家们看看评委们的意见(F口面上) +4 gdd2018 2026-08-28 9/450 2026-08-28 14:22 by jklily
[基金申请] 怎么查啊 +6 huang1991js 2026-08-26 6/300 2026-08-28 08:42 by winsaint
[基金申请] 哪位高人中了,把查询到的截图贴出来让我看看,让我长长见识 +5 yuleib84 2026-08-26 6/300 2026-08-28 00:02 by yudaoqian88
[基金申请] 看板上这么多中的,有点像50人群里49个人都是骗子的那种感觉…… +5 a089 2026-08-26 6/300 2026-08-27 14:05 by jonewore
[基金申请] 怎么看青基中了没有啊 +5 叶九微 2026-08-26 5/250 2026-08-27 10:35 by l_zh2008
[基金申请] 为什么 国际(地区)合作与交流项目 没有放榜? 10+3 majunge000 2026-08-26 11/550 2026-08-27 08:42 by 北京莱茵编辑
[基金申请] 我不理解! +15 Edward_pc 2026-08-26 23/1150 2026-08-26 20:34 by zzuzxg
[基金申请] 2026年的国家社科基金项目通讯评审的新规则与新动向、新挑战 +7 process2012 2026-08-23 10/500 2026-08-26 19:23 by hmhminy
[基金申请] 为什么国自然不能直接公布 +4 bjdxyxy 2026-08-26 4/200 2026-08-26 13:12 by qingmu1201
[基金申请] 系统进不去 +4 yanglien 2026-08-26 5/250 2026-08-26 11:10 by wenfengw83
[基金申请] 国合可查了 +3 paperzjh 2026-08-26 3/150 2026-08-26 10:41 by LemmonTr
[基金申请] 国合现在查不到了吗? +10 chengyan1220 2026-08-24 20/1000 2026-08-26 08:57 by peasantsprig
[基金申请] 在坚冰还盖着北海的时候,我看到了怒放的梅花。 (金币+10) +6 ziyangfang 2026-08-25 9/450 2026-08-25 20:26 by huagongfeihu
[基金申请] 某些机构,以效率低为荣,以效率低作为存在感 +9 yuleib84 2026-08-25 10/500 2026-08-25 17:14 by alexon
[基金申请] 如果此刻你正在为国基感到焦虑,不妨来听听这首《基金之外》 +8 scalable 2026-08-24 8/400 2026-08-25 12:52 by jnhyjjm
[教师之家] 跳槽后在研项目怎么办? +5 简单化xn 2026-08-22 10/500 2026-08-23 12:38 by 简单化xn
信息提示
请填处理意见