A Study of Line Simplification and Data Structure in Digital Maps

• Main Author: 吳逸凡
• Other Authors: 楊正甫
• Format: Others
• Language: zh-TW
• Published: 1994
• Online Access: http://ndltd.ncl.edu.tw/handle/36962198242749520881

碩士 === 國防管理學院 === 資源管理研究所 === 82 === 　　Automated generalization is a important and necessary process in computerp-assisted graphy. It is used to process the data of maps on a larger scale, and then produces a smaller one automatically. 　　Linear features are dominant in conventional maps, and own higher percentage in the vectorized digital maps. So the subject of this study is line, such as administrative boundary line, coast line etc.. There are many find of simplification aglorithm, while in order to process in computer, it is more important that data sructure of data simplitied. A movel simplification algorithm and data structure are introduced in this thesis, which improve the building of binary generalization tree made in Douglas algorithm. they process the coordinates effectively for the purpose of archieveing the goal of logical zooming. In accordance with the drawback of perpendicular distance algorithm (P D A), a new algorithm - E P D A is developed. It improve the destorsion of line simplitied in P D A.