SearcharxivSearch

arXiv · 1406.5410

The Fractal Nature of Maps and Mapping

Abstract

A fractal can be simply understood as a set or pattern in which there are far more small things than large ones, e.g., far more small geographic features than large ones on the earth surface, or far more large-scale maps than small-scale maps for a geographic region. This paper attempts to argue and provide evidence for the fractal nature of maps and mapping. It is the underlying fractal structure of geographic features, either natural or human-made, that make reality mappable, large-scale maps generalizable, and cities imageable. The fractal nature is also what underlies the beauty of maps. After introducing some key fractal concepts such as recursion, self-similarity, scaling ratio, and scaling exponent, this paper demonstrates that fractal thought is rooted in long-standing map-making practices such as series maps subdivision, visual hierarchy, and Töpfer's radical law. Drawing on previous studies on head/tail breaks, mapping can be considered a head/tail breaks process; that is to divide things around an average, according to their geometric, topological and/or semantic properties, into the head (for those above the average) and the tail (for those below the average), and recursively continue the dividing process for the head for map generalization, statistical mapping, and cognitive mapping. Given the fractal nature of maps and mapping, cartography should be considered a perfect combination of science and art, and scaling must be formulated as a law of cartography or that of geography in general. Keywords: Scaling of geographic features, map generalization, statistical mapping, cognitive mapping, head/tail breaks

Explore related subjects

Keep this discovery

BibTeXRIS

Bin Jiang. 2014-08-16. The Fractal Nature of Maps and Mapping. https://doi.org/10.1080/13658816.2014.953165

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO