Map coloring


Map coloring

Map coloring is the act of assigning different colors to different features on a map. There are two very different uses of this term. The first is in cartography, choosing the colors to be used when producing a map. The second is in mathematics, where the problem is to determine the minimum number of colors needed to color a map so that no two adjacent features have the same color.

Cartography

A map of the United States using colors to show political divisions.
The US Presidential Election of 2004, visualised using a choropleth map
Topographic map of Easter Island, using colors to show elevations.

Color is a very useful attribute to depict different features on a map.[1] Typical uses of color include displaying different political divisions, different elevations, or different kinds of roads. A choropleth map is a thematic map in which areas are colored differently to show the measurement of a statistical variable being displayed on the map. The choropleth map provides an easy way to visualize how a measurement varies across a geographic area or it shows the level of variability within a region.

Displaying the data in different hues can greatly affect the understanding or feel of the map.[2] Also, the cartographer must take into account that many people have impaired color vision, and use colors that are easily distinguishable by these readers.[3]

Colors can also be used to produce three dimensional effects from two dimensional maps, either by explicit color coding of the two images intended for different eyes, or by using the characteristics of the human visual system to make the map look three dimensional.[4]

Mathematics

In mathematics there is a very strong link between map coloring and graph coloring, since every map showing different areas has a corresponding graph. By far the most famous result in this area is the four color theorem, which states that any planar map can be colored with at most four colors.

References

  1. ^ Matt Rosenberg. "Map Colors - The Role of Colors on Maps". http://geography.about.com/od/understandmaps/a/mapcolors.htm. 
  2. ^ Robinson, A.H. (1967). "Psychological aspects of color in cartography". International Yearbook of Cartography 7: pp. 50--61. 
  3. ^ Brewer, C. (1996). "Guidelines for selecting colors for diverging schemes on maps". The Cartographic Journal (Maney Publishing) 33 (2): pp. 79--86. http://www.ingentaconnect.com/content/maney/caj/1996/00000033/00000002/art00002. 
  4. ^ Eyton, J.R. (1990). "Color stereoscopic effect cartography". Cartographica: The International Journal for Geographic Information and Geovisualization (UT Press) 27 (1): 20–29. doi:10.3138/K213-2288-7672-U72T. http://utpjournals.metapress.com/content/k21322887672u72t/. 

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Map-coloring games — Several map coloring games are studied in combinatorial game theory. The general idea is that we are given a map with regions drawn in but with not all the regions colored. Two players, Left and Right, take turns coloring in one uncolored region… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Combinatorial map — A combinatorial map is a combinatorial object modelling topological structures with subdivided objects. Historically, the concept was introduced informally by J. Edmonds for polyhedral surfaces [1] which are planar graphs. It was given its first… …   Wikipedia

  • Circular coloring — In graph theory, circular coloring may be viewed as a refinement of usual graph coloring. The circular chromatic number of a graph G, denoted χc(G) can be given by any of the following definitions, all of which are equivalent (for finite graphs) …   Wikipedia

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • Fox n-coloring — In the mathematical field of knot theory, Fox n coloring is a method of specifying a representation of a knot group (or a link group) onto the dihedral group of order n where n is an odd integer by coloring arcs in a link diagram (the… …   Wikipedia

  • Domain coloring — plot of the function ƒ(x) =(x2 − 1)(x − 2 − i)2/(x2 + 2 + 2i). The hue represents the function argument, while the saturation represents the magnitude. Domain coloring is a technique for… …   Wikipedia

  • Thematic map — Edmond Halley s New and Correct Chart Shewing the Variations of the Compass (1701), the first chart to show lines of equal magnetic variation. A thematic map is a type of map or chart especially designed to show a particular theme connected with… …   Wikipedia

  • Mitchell Map — Not to be confused with Mitchell s School Atlas. The Mitchell Map The Mitchell Map is a map made by John Mitchell (1711–1768), which was reprinted several times during the second half of the 18th century. The Mitchell Map was used as a primary… …   Wikipedia

  • Bivariate map — A bivariate map displays two variables on a single map by combining two different sets of graphic symbols or colors. Bivariate mapping is an important technique in cartography. Given a set of geographic features, a bivariate map displays two… …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.