Header

UZH-Logo

Maintenance Infos

Variable-scale maps in real-time generalisation using a quadtree data structure and space deforming algorithms


Bereuter, Pia; Weibel, Robert (2017). Variable-scale maps in real-time generalisation using a quadtree data structure and space deforming algorithms. International Journal of Cartography, 3(1):134-147.

Abstract

Variable-scale maps have been advocated by several authors in the context of mobile cartography. In the literature on real-time map generalisation, however, corresponding methods that resolve cartographic conflicts by deformation of the underlying map space together with the map foreground, are underrepresented. This paper demonstrates how the concept of a malleable space can be applied as a part of the generalisation process and incorporated into the overall methodology of point generalisation. Two different algorithms are used, a density-equalising cartogram algorithm and Laplacian smoothing. Both methods work in real-time and are datadriven. In addition, they allow for a parameterisation in combi-nation with a quadtree data structure, as well as a combination with 'classic' generalisation operators (e.g. selection, aggregation, displacement) based on the quadtree. The quadtree serves both as a spatial index for fast retrieval and search of points, and as a density estimator to inform generalisation operators. The use of the quadtree as a common spatial index provides a tool to combine variable-scale maps with classic generalisation. A combination of the two allows, at small map scales, the maintenance of detail in dense areas and data reduction in sparse areas. Additionally, it facilitates building a modular workflow for real-time map generalisation.

Abstract

Variable-scale maps have been advocated by several authors in the context of mobile cartography. In the literature on real-time map generalisation, however, corresponding methods that resolve cartographic conflicts by deformation of the underlying map space together with the map foreground, are underrepresented. This paper demonstrates how the concept of a malleable space can be applied as a part of the generalisation process and incorporated into the overall methodology of point generalisation. Two different algorithms are used, a density-equalising cartogram algorithm and Laplacian smoothing. Both methods work in real-time and are datadriven. In addition, they allow for a parameterisation in combi-nation with a quadtree data structure, as well as a combination with 'classic' generalisation operators (e.g. selection, aggregation, displacement) based on the quadtree. The quadtree serves both as a spatial index for fast retrieval and search of points, and as a density estimator to inform generalisation operators. The use of the quadtree as a common spatial index provides a tool to combine variable-scale maps with classic generalisation. A combination of the two allows, at small map scales, the maintenance of detail in dense areas and data reduction in sparse areas. Additionally, it facilitates building a modular workflow for real-time map generalisation.

Statistics

Citations

Dimensions.ai Metrics

Altmetrics

Downloads

14 downloads since deposited on 12 Jan 2018
14 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Geography
Dewey Decimal Classification:910 Geography & travel
Language:English
Date:2017
Deposited On:12 Jan 2018 12:56
Last Modified:19 Feb 2018 10:22
Publisher:Taylor & Francis
ISSN:2372-9333
OA Status:Green
Publisher DOI:https://doi.org/10.1080/23729333.2017.1304189

Download

Download PDF  'Variable-scale maps in real-time generalisation using a quadtree data structure and space deforming algorithms'.
Preview
Content: Accepted Version
Language: English
Filetype: PDF
Size: 3MB