全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
测绘学报  2014 

面向道路网络地图示意化的线形简化方法

DOI: 10.13485/j.cnki.11-2089.2014.0190

Keywords: 道路网络地图,自动示意化,线形简化

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对当前示意网络地图线形状简化方法中存在需要人工干预或地图认知度低的问题,本文提出自动化程度高并能保证良好地图认知的线形状简化方法.该方法通过合理设定线形状简化中所需的阈值以避免人工干预,提高了线形状简化过程的自动化程度,并通过在简化过程中应用平滑算法,以减少示意结果中线对象在方向上的转折数,从而提高了简化度和清晰度.试验表明该方法不仅可以生成清晰的示意结果,并且能够保证良好的地图认知度.

References

[1]  MERRICK D, GUDMUNDSSON J. Increasing the Readability of Graph Drawings with Centrality-based Scaling[C]//Proceeding of Asia-Pacific Symposium Information Visualization. Tokyo:[s.n.], 2006:67-76.
[2]  HONG S H, MERRICK D, NOSCIMENTO H A D. Automatic Visualisation of Metro Maps[J]. Journal of Visual Languages and Computing, 2006, 17(3):203-224.
[3]  STOTT J, RODGERS P, MARTINEZ-OVANDO J C, et al. Automatic Metro Map Layout Using Multicriteria Optimization[J]. IEEE Transactions on Visualization and Computer Graphics, 2011, 17(1):101-114.
[4]  NOELLENBURG M, WOLFF A. Drawing and Labeling High-quality Metro Maps by Mixed-integer Programming[J]. IEEE Transactions on Visualization and Computer Graphics, 2011, 17(5):626-641.
[5]  AGRAWALA M, STOLTE C. Rendering Effective Route Maps: Improving Usability through Generalization[C]//Proceedings of Association for Computing Machinery SIGGRAPH.[S.l.]:ACM,2001: 241-250.
[6]  TVERSKY B, LEE P U. Pictorial and Verbal Tools for Conveying Routes[C]//Proceedings of the International Conference on Spatial Information Theory.London: COSIT,1999:51-64.
[7]  AI Tinghua. Maps Adaptable to Represent Spatial Cognition[J]. Journal of Remote Sensing, 2008, 12(2):347-354. (艾廷华. 适宜空间认知结果表达的地图形式[J]. 遥感学报, 2008, 12(2):347-354.)
[8]  AVELAR S. Convergence Analysis and Quality Criteria for an Iterative Schematization of Networks[J]. GeoInformatica, 2007, 11(4):497-513.
[9]  GARLAND K. Mr Beck's Underground Map[M]. Harrow Weald: Capital Transport, 1994.
[10]  JENNY B. Geometric Distortion of Schematic Network Maps[J]. Society of Cartographer Bulletin, 2006, 40:15-18.
[11]  TI P, LI Z L. Generation of Schematic Network Maps with Automated Detection and Enlargement of Congested Areas[J]. International Journal of Geographical Information Science, 2014, 28(3):521-540.
[12]  AVELAR S, MUELLER M. Generating Topologically Correct Schematic Maps[C]//Proceedings of the 9th International Spatial Data Handling.Beijing:[s.n.], 2000: 28-35.
[13]  CABELLO S, DE BERG M, VAN DIJK S, et al. Schematization of Road Networks[C]//Proceedings of the Seventeenth Annual Symposium on Computational Geometry.Massachusetts:[s.n.], 2001: 33-41.
[14]  WARE J M, ANAND S, TAYLOR G E, et al. Automated Production of Schematic Maps for Mobile Applications[J]. Transactions in GIS, 2006, 10(1):25-42.
[15]  DONG Weihua, GUO Qingsheng, LIU Jiping, et al. Progressive Generalization Research of Schematic Road Network Maps[J]. Geomatics and Information Science of Wuhan University, 2007, 32(9): 829-832. (董卫华, 郭庆胜, 刘纪平, 等. 道路网示意性地图的渐进式综合研究[J]. 武汉大学学报:信息科学版, 2007, 32(9):829-832.)
[16]  LI Z L, DONG W H. A Stroke-based Method for Automated Generation of Schematic Network Maps[J]. International Journal of Geographical Information Science, 2010, 24(11):1631-1647.
[17]  HE Jin, FEI Lifan, HUANG Lina, et al. Study on the Method of Indirect Generalization for Contour Lines Based on the 3D Douglas-Peucker Algorithm[J]. Acta Geodaetica et Cartographica Sinica, 2013, 42(3):467-473.(何津,费立凡,黄丽娜,等.三维Douglas-Peucker算法的等高线间接综合方法研究[J].测绘学报,2013,42(3):467-473.)
[18]  KLIPPEL A. Conceptualizing Wayfinding and Route Direction Elements[D]. Jacobs: Universitat Bremen, 2003.
[19]  THOMSON R C, RICHARDSON D E. The 'Good Continuity' Principle of Perceptual Organization Applied to the Generalization of Road Networks[C]//Proceeding of the 19th International Cartographic Conference.Ottawa:[s.n.],1999: 1215-1225.
[20]  LI Z L. Algorithm Foundation of Multi-scale Spatial Representation[M]. London: CRC Press, 2006.
[21]  TOBLER W. Numeric Map Generalization[J]. Cartographica, 1966, 26(1):9-25.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133