Multi-way Trees Representation for Curve Bends

Abstract

Abstract: According to the defects of current bend identification methods, this paper proposes a multi-way tree structure for representation of curve bends. The method uses curve axis to identify curve bends. Bends which exist in different direction and different range of curve are extracted hierarchically by a recursive way and a multi-way tree of bends is generated according to extraction results. Finally, the multi-way tree of bends was used in the experiment of line generalization and verified its effectiveness.

Key words: curve bends, cartographic generalization, multi-way trees, curve morphology

CLC Number:

P208
P283.7

References

[1] ZHU Guorui, GUO Lizhen, YIN Gongbai, XU Yongli. Map Design and Compilation [M]. Wuhan: Wuhan: University Press,2001.(祝国瑞,郭礼珍,尹贡白,徐永利. 地图设计与编绘[M]. 武汉:武汉大学出版社, 2001.)
[2] WANG Z, MULLER JC. Line Generalization Based on Analysis of Shape [J]. Cartography and Geographic Information System, 1998, 25 (1):3-15.
[3] ZHANG Qingnian, LIAO Ke. Line Generalization Based on Structure Analysis [J]. ACTA SCIENTIARUM NATURALIUM UNIVERSITATIS SUNYATSENI, 2001,40(5):118-121. (张青年,廖克.基于结构分析的曲线概括方法[J]. 中山大学学报(自然科学版), 2001,40(5):118-121.)
[4] LUO Guangxiang, ZHU Guorui, WU Hehai, YANG Yu-hong. The Study of the Model of Identifying Bends for Cartographic Linear Features Based on Analysing Coordinate Monotony [J]. Bulletin of Surveying and Mapping, 2005,10:21-24. (罗广详,祝国瑞,毋河海,杨宇鸿.坐标单调性分析下地图曲线弯曲识别模型的研究[J].测绘通报,2005,10:21-24.)
[5] CHEN Huirong, PENG Rencan, ZHENG Yidong, LI Shujun. Coastline Generalization Based on Skeleton Line of Curve Bends [J]. Geomatics and Information Science of Wuhan University,2011,36(12):1418-1422. (陈惠荣,彭认灿,郑义东,李树军.以弯曲骨架线为化简指标的海岸线综合方法[J].武汉大学学报(信息科学版),2011,36(12):1418-1422.)
[6] QIAN Haizhong, WU Fang, CHEN Bo, ZHANG Jinghui, WANG Jiayao. Simplifying Line with Oblique Dividing Curve Method [J].ACTA GEODAETICA et CARTOGRAPHICA SINICA, 2007,36(4):443 -449. 钱海忠,武芳,陈波,张景辉,王家耀.采用斜拉式弯曲划分的曲线化简方法[J]. 测绘学报,2007,36(4):443 -449.)
[7] GUO Qingsheng, HUANG Yuanlin, ZHANG Liping. The Method of Curve Bend Recognition[J]. Geomatics and Information Science of Wuhan University,2008,33(6):596-599. (郭庆胜,黄远林,章莉萍.曲线的弯曲识别方法研究[J].武汉大学学报(信息科学版),2008,33(6):596-599.)
[8] AI Tinghua, GUO Renzhong, LIU Yaolin. A Binary Tree Representation of Curve Hierarchical Structure in Depth [J]. ACTA GEODAETICA et CARTOGRAPHICA SINICA,2001,30(4):343-348. (艾廷华,郭仁忠,刘耀林.曲线弯曲深度层次结构的二叉树表达[J].测绘学报,2001,30(4):343-348.)
[9] van der Poorten PM, Jones CB.Characterisation and generalisation of cartographic lines using Delaunay triangulation [J]. International Journal of Geographical Information Science, 2002,16(8):773-794.
[10] van der Poorten PM, Sheng Zhou, Jones CB. Topologically-Consistent Map Generalisation Procedures and Multi-scale Spatial Databases [C]. Lecture Notes in Computer Science, 2002, 2478:209-227.
[11] ZHAI Renjian, WU Fang, ZHU Li, ZHU Qiang. Structured Representation of Curve Shape[J]. ACTA GEODAETICA et CARTOGRAPHICA SINICA, 2009,38(2):175-182.(翠仁健,武芳,朱丽,朱强.曲线形态的结构化表达 [J].测绘学报, 2009,38(2):175-182.)
[12] Douglas DH, Peucker TK. Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Character [J]. The Canadian Cartographer, 1973 ,10 (2) :112-123.
[13] Saalfeld A. Topologically consistent line simplification with the Douglas-Peucker algorithm [J]. Cartography and Geographic Information Science, 1999, 26(1):7–18.
[14] Bentley JL, Ottmann TA. Algorithms for reporting and counting geometric intersections [J]. IEEE Transactions on Computers, 1979, 28(9):643-647.
[15] Park SC, Hayong Shin. Polygonal chain intersection [J].Computers & Graphics, 2002, 26(2):341-350.