Data classification for highlighting polygons with local extreme values in choropleth maps

Jochen Schiewe*

*Corresponding author for this work

Abstract

Following the general demand for task-orientation in map design, one specific task will be examined here: the preservation and highlighting of local extreme values in choropleth maps. Extreme value polygons are ones that show a larger (local maximum) or smaller (local minimum) attribute value compared to all directly neighboring polygons. For a visual identification in a classified choropleth map, such a polygon must belong to a class other than the surrounding polygons. However, data classification methods that are commonly used in the process of generating choropleth maps are data-driven, i.e., the intervals are determined solely on the basis of the present frequency distribution of the original values. With such a division along the number line, the spatial context of the underlying data is completely neglected and with that the desired categorization for local extreme values is not guaranteed. As a consequence, a new method (called PLEX) is presented for this purpose. The application and the effectiveness of this method will be demonstrated using real-world examples.
Original languageEnglish
Title of host publicationAdvances in Cartography and GIScience - Selections from the International Cartographic Conference, 2017
EditorsMichael P. Peterson
Pages449-459
Number of pages11
Edition1.
ISBN (Electronic)978-3-319-57336-6
DOIs
Publication statusPublished - 31 May 2017
Event28th International Cartographic Conference, ICC 2017 - Washington, United States
Duration: 2 Jul 20177 Jul 2017

Publication series

NameLecture Notes in Geoinformation and Cartography
PublisherSpringer International Publishing
ISSN (Print)1863-2246
ISSN (Electronic)1863-2351

Conference

Conference28th International Cartographic Conference, ICC 2017
Country/TerritoryUnited States
CityWashington
Period2/07/177/07/17

Keywords

  • Choropleth mapping
  • Data classification
  • Task-oriented

Cite this