Map generalization: Information theoretic approach to feature elimination.

Jan Terje Bjørke · Inge Myklebust

14 citations0/0 files stored

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Geographic Information Systems Studies Historical Geography and Cartography Data Visualization and Analytics

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 14 citations exist upstream.

References

1992Generalization in Digital Cartography 2014Geographical Information Systems and Computer Cartography 1996Framework for Entropy-based Map Evaluation

Cited by

2019An overview of generalization techniques for street networks 2005Map Generalization of Road Networks 2020Measuring maps graphical density via digital image processing method on the example of city maps 2009Quantitatively Optimized Selection of Proper Scale in Land Use Cartographic Generalization 2012Automated evaluation of generalized topographic maps

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.