南京师大学报（自然科学版）2012，Vol.35Issue(1)：111-116,6.
点群选取与化简算法时问复杂度研究
A Study on the Time Complexity of Point Cluster Selection and Simplification Algorithms
摘要
Abstract
Being a basic element of the map, point feature is the important content of general and thematic map representation. With the development of web maps and mobile maps, point of interest ( POI) has become the most important element to be represented, and the production, updating and visualization of POI is becoming a top issue in recent years. Facing to point cluster generalization, the selection and simplification operations are often adopted. However, the traditional point cluster selection and simplification algorithms mainly aim at the automatic production of paper maps, which concern more about the quality of the generalization instead of the efficiency. This may not satisfy the needs of the real -time representation of CIS data and the development of LBS services. In this paper, the previous algorithms of point selection and simplification are reviewed and classified into four categories according to their implementation principles. One representative algorithm of each category are selected to be particularly analyzed for their time complexities. The feasibility of being applied to the parallel environment is also discussed. The study of this paper will lay a foundation for the application and development of the point cluster selection and simplification algorithms in web mapping and emergency mapping services.关键词
点群要素/选取/化简/算法/时间复杂度Key words
point cluster/selection/simplification/algorithm/time complexity分类
天文与地球科学引用本文复制引用
于艳平,沈婕,尚在颖..点群选取与化简算法时问复杂度研究[J].南京师大学报（自然科学版）,2012,35(1):111-116,6.基金项目
国家自然科学基金(41071288,41171350). （41071288,41171350）
