[1] 王姣姣, 赵学胜, 曹文民, 等.利用球面DQG格网的地形与矢量线自适应叠加算法[J].武汉大学学报信息科学版, 2014, 39(9): 1 057-1 060 http://d.old.wanfangdata.com.cn/Periodical/whchkjdxxb201409010

Wang Jiaojiao, Zhao Xuesheng, Cao Wenmin, et al. An Algorithm for Adaptive Overlap of Vector Polyline and DEM Based on Spherical DQG[J]. Geomatics and Information Science of Wuhan University, 2014, 39(9): 1 057-1 060 http://d.old.wanfangdata.com.cn/Periodical/whchkjdxxb201409010
[2] 张宏, 温永宁, 刘爱利, 等.地理信息系统算法基础[M].北京:科学出版社, 2006

Zhang Hong, Wen Yongning, Liu Aili, et al. The Basis of Geographic Information System Algorithm[M]. Beijing: Science Press, 2006
[3] 刘人午, 李燕.扫描细化算法的地图自动矢量化研究[J].测绘学报, 2012, 41(2):309-314 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=chxb201202027

Liu Renwu, Li Yan. Study of Auto-vectorization Based on Scan-Thinning Algorithm[J]. Acta Geodaetica et Cartographica Sinica, 2012, 41(2):309-314 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=chxb201202027
[4] Mccrea P G, Baker P W. On Digital Differential Analyzer (DDA) Circle Generation for Computer Graphics[M]. Washington D C:IEEE Computer Society, 1975
[5] Reid-Green K S. Three Early Algorithms[J]. IEEE Annals of the History of Computing, 2002, 24(4):10-13 doi:  10.1109/MAHC.2002.1114866
[6] Bresenham J E. Algorithm for Computer Control of a Aigital Plotter[J]. IBM Systems Journal, 1965, 4(1):25-30 doi:  10.1147/sj.41.0025
[7] Wu X, Rokne J G. Double-Step Incremental Generation of Lines and Circles[J]. Computer Vision Graphics and Image Processing, 1987, 37(3):331-344 doi:  10.1016/0734-189X(87)90041-7
[8] 贾银亮, 张焕春, 经亚枝, 等. 6步直线生成算法[J].山东大学学报(工学版), 2007, 37(1):61-64 doi:  10.3969/j.issn.1672-3961.2007.01.015

Jia Yinliang, Zhang Huanchun, Jing Yazhi, et al. A Six-Step Algorithm for Line Drawing[J]. Journal of Shandong University(Engineering Science), 2007, 37(1):61-64 doi:  10.3969/j.issn.1672-3961.2007.01.015
[9] 黄斌茂, 张利.基于自适应步长的直线生成算法[J].清华大学学报(自然科学版), 2006, 46(10):1 719-1 722 http://d.old.wanfangdata.com.cn/Periodical/qhdxxb200610021

Huang Binmao, Zhang Li. Self-adaptive Step Straight-Line Algorithms[J]. Journal of Tsinghua University(Science and Technology), 2006, 46(10):1 719-1 722. http://d.old.wanfangdata.com.cn/Periodical/qhdxxb200610021
[10] Vince A. Discrete Lines and Wandering Paths[J]. SIAM Journal on Discrete Mathematics, 2007, 21(3):647-661 doi:  10.1137/050642009
[11] 白建军, 赵学胜, 陈军.基于线性四叉树的全球离散格网索引[J].武汉大学学报·信息科学版, 2005, 30(9): 805-808 http://ch.whu.edu.cn/CN/abstract/abstract2276.shtml

Bai Jianjun, Zhao Xuesheng, Chen Jun. Indexing of Discrete Global Grids Using Linear Quadtree[J]. Geomatics and Information Science of Wuhan University, 2005, 30(9): 805-808 http://ch.whu.edu.cn/CN/abstract/abstract2276.shtml
[12] Freeman H. Algorithm for Generating a Digital Straight Line on a Triangular Grid[J]. IEEE Computer Society, 1979, 28(2): 150-152 https://www.researchgate.net/publication/3047290_Algorithm_for_Generating_a_Digital_Straight_Line_on_a_Triangular_Grid
[13] Nagy B. Shortest Paths in Triangular Grids with Neighborhood Sequences[J]. Journal of Computing and Information Technology, 2004, 11(2):55-60
[14] Sarkar A, Biswas A, Mondal S, et al. Finding Shortest Triangular Path in a Digital Object[C]. International Conference on Discrete Geometry for Computer Imagery, Vladivostok, Russky Island, Russia, 2016
[15] Maurin K.Duality (Polarity) in Mathematics, Physics and Philosophy[J]. Reports on Mathematical Physics, 1988, 25(3): 357-388
[16] Mahdavi-Amiri A, Harrison E. Samavati F. Hierarchical Grid Conversion[M]. Oxford: Butterworth-Heinemann, 2016
[17] 周成虎, 欧阳, 马廷.地理格网模型研究进展[J].地理科学进展, 2009, 28(5):657-662 http://d.old.wanfangdata.com.cn/Periodical/dlkxjz200905001

Zhou Chenghu, Ou Yang, Ma Ting.Progresses of Geographical Grid Systems Researches[J]. Progress in Geography, 2009, 28(5):657-662 http://d.old.wanfangdata.com.cn/Periodical/dlkxjz200905001