Thumbnail
Access Restriction
Open

Author Bjørke, Jan Terje ♦ Bj¿rke, Jan Terje ♦ Myklebust, Inge
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Point Elimination ♦ Cartographic Generalization ♦ Point Symbol ♦ Optimal Symbol Size ♦ Map Generalization ♦ Present Paper ♦ Information Theoretic Approach ♦ High Degree ♦ Entropy Model ♦ Feature Elimination ♦ Entropy Measure ♦ Point Cluster ♦ Conicting Map Symbol
Description The present paper proposes an entropy based algorithm for the feature elimination in cartographic generalization. The methodology is tested on a map with 100 point symbols. The experiment demonstrates how the most conicting map symbols are detected and eliminated from the map. The optimal symbol size can be computed from the entropy model. It is shown how to modify the entropy measure in such a way that the point elimination to a high degree preserves the point clusters.
Proceedings of ICC97, 18th International Cartographic Conference
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2001-01-01