원문정보
초록
영어
The problems of the icons covering each other and slow data loading are very challenging when the GIS technology is applied to load a large number of topological nodes. A novel algorithm for aggregating the topological nodes in GIS based on the hierarchical clustering algorithm is presented in this paper. Comparison with the hierarchical clustering algorithm and partitioning algorithm is explored. In addition, the implementation of the algorithm is derived. The experiment demonstrates that the algorithm solved the problems of the icons covering each other and slow data loading effectively, realized the aggregation of the topological nodes preferably, and presented the distributed trend of the topological nodes and the topology relation between each other in the topology. The experimental results verify the effectiveness of the method.
목차
1. Introduction
2. Aggregation Algorithm
2.1. Hierarchical Clustering Algorithm
2.2. Partitioning Algorithm
2.3. Comparison of the Hierarchical Clustering Algorithm and the Partitioning Algorithm
3. Aggregating the topological nodes in GIS
3.1. Research Status
3.2. Basic Idea of the Algorithm
3.3. Principle of the Algorithm
3.4. Concrete Realization of the Algorithm
3.5. Advantages of the Algorithm
4. Experiment
4.1. Compare the Time of the Map Load the Different Numbers of Topological Node, when we do not Use any Aggregation Algorithm and Use this Aggregation Algorithm
4.2. Effect of Before Aggregation and after Aggregation with this Aggregation Algorithm
5. Conclusion
Acknowledgments
References