Skip to main content

Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations

  • Conference paper
  • First Online:
Geospatial Data in a Changing World

Abstract

Continuous generalization aims to produce maps at arbitrary scales without abrupt changes. This helps users keep their foci when working with digital maps interactively, e.g., zooming in and out. Topological consistency is a key issue in cartographic generalization. Our aim is to ensure topological consistency during continuous generalization. In this paper, we present a five-step method for continuously generalizing between two maps of administrative boundaries at different scales, where the larger-scale map has not only more details but also an additional level of administrative regions. Our main contribution is the proposal of a workflow for generalizing hierarchical administrative boundaries in a continuous and topologically consistent way. First, we identify corresponding boundaries between the two maps. We call the remaining boundary pieces (on the larger-scale map) unmatched boundaries. Second, we use a method based on so-called compatible triangulations to generate additional boundaries for the smaller-scale map that correspond to the unmatched boundaries. Third, we simplify the resulting additional boundaries. Fourth, we determine corresponding points for each pair of corresponding boundaries using a variant of an existing dynamic programming algorithm. Fifth, we interpolate between the corresponding points to generate the boundaries at intermediate scales. We do a thorough case study based on the provinces and counties of Mainland China. Although topologically consistent algorithms for the third step and the fifth step exist, we have implemented simpler algorithms for our case study.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Interactive animations of some provinces are available at http://www1.pub.informatik.uni-wuerzburg.de/pub/data/agile2016/. (We recommend opening the link with Google Chrome).

References

  • Aronov B, Seidel R, Souvaine DL (1993) On compatible triangulations of simple polygons. Comput Geom 3:27–35

    Article  Google Scholar 

  • Babikov M, Souvaine DL, Wenger R (1997) Constructing piecewise linear homeomorphisms of polygons with holes. In: Proceedings of 9th Canadian Conference Computing Geometry (CCCG’97), pp 6–10

    Google Scholar 

  • Bereg S (2005) An approximate morphing between polylines. Int J Comput Geom Appl 15(2):193–208

    Article  Google Scholar 

  • Bronstein IN, Semendjajew KA, Musiol G, Mühlig H (2001) Taschenbuch der Mathematik, 5th edn. Wissenschaftlicher Verlag Harri Deutsch

    Google Scholar 

  • Cecconi A (2003) Integration of cartographic generalization and multi-scale databases for enhanced web mapping. Ph.D. thesis, Universität Zürich

    Google Scholar 

  • Danciger J, Devadoss SL, Mugno J, Sheehy D, Ward R (2009) Shape deformation in continuous map generalization. Geoinformatica 13:203–221

    Article  Google Scholar 

  • de Berg M, Cheong O, Kreveld MV, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer-Verlag TELOS

    Google Scholar 

  • Douglas DH, Peucker TK (1973) Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica 10(2):112–122

    Article  Google Scholar 

  • Doytsher Y, Filin S, Ezra E (2001) Transformation of datasets in a linear-based map conflation framework. Surv Land Inf Syst 61(3):159–169

    Google Scholar 

  • Fuse T, Shimizu E (2004) Visualizing the landscape of old-time Tokyo (Edo city). In: Gruen A, Murai S, Fuse T, Remondino F (eds) The international archives of the photogrammetry, remote sensing and spatial information sciences

    Google Scholar 

  • Girres JF, Touya G (2014) Cartographic generalisation aware of multiple representations. In: Duckham M, Stewart K, Pebesma E (eds) Proceedings of 8th international Conference on Geographic Information Science—poster session

    Google Scholar 

  • Gotsman C, Surazhsky V (2001) Guaranteed intersection-free polygon morphing. Comput Graph 25(1):67–75

    Article  Google Scholar 

  • Hampe M, Sester M, Harrie L (2004) Multiple representation databases to support visualization on mobile devices. In: Proceedings of ISPRS congress, volume XXXV–B4: IV of international archives of photogrammetry, remote sensing and spatial information sciences, pp 135–140

    Google Scholar 

  • Haunert JH (2005) Link based conflation of geographic datasets. In: Proceedings of 8th ICA workshop generalisation and multiple representation

    Google Scholar 

  • Hershberger J, Snoeyink J (1992) Speeding up the Douglas–Peucker line-simplification algorithm. In: Proceedings of 5th international sympoisum on spatial data handling, pp 134–143

    Google Scholar 

  • Mustière S, Devogele T (2008) Matching networks with different levels of detail. GeoInformatica 12(4):435–453

    Article  Google Scholar 

  • Nöllenburg M, Merrick D, Wolff A, Benkert M (2008) Morphing polylines: a step towards continuous generalization. Comput Environ Urban Syst 32(4):248–260

    Article  Google Scholar 

  • Pantazis D, Karathanasis B, Kassoli M, Koukofikis A, Stratakis P (2009) Morphing techniques: towards new methods for raster based cartographic generalization. In: Proceedings of 24th International Cartographic Conference (ICC’09)

    Google Scholar 

  • Peng D, Haunert JH, Wolff A (2013) Morphing polylines based on least squares adjustment. In: Proceedings of 16th ICA generalisation workshop (ICAGW’13), 10 pages

    Google Scholar 

  • Reilly DF, Inkpen K (2004) Map morphing: making sense of incongruent maps. In: Heidrich W, Balakrishnan R (eds) Proceedings of graphics interface, volume 62 of ACM international conference proceedings series. Canadian Human-Computer Communications Society, pp 231–238

    Google Scholar 

  • Saalfeld A (1985) A fast rubber-sheeting transformation using simplicial coordinates. Am Cartogr 12(2):169–173

    Article  Google Scholar 

  • Saalfeld A (1999) Topologically consistent line simplification with the Douglas-Peucker algorithm. Cartogr Geogr Inf Sci 26(1):7–18

    Article  Google Scholar 

  • Schneider T, Hormann K (2015) Smooth bijective maps between arbitrary planar polygons. Comput Aided Geom Des 35:243–354

    Article  Google Scholar 

  • Sester M, Brenner C (2004) Continuous generalization for fast and smooth visualization on small displays. In: Altan O (ed) In: Proceedings of 20th ISPRS congress, volume XXXV (Part B4) of international archives of the photogrammetry, remote sensing and spatial information sciences, pp 1293–1298

    Google Scholar 

  • Surazhsky V, Gotsman C (2001) Controllable morphing of compatible planar triangulations. ACM Trans Graph 20(4):203–231

    Article  Google Scholar 

  • van Kreveld M (2001) Smooth generalization for continuous zooming. In: Proceedings of 20th International Cartographic Conference (ICC’01)

    Google Scholar 

  • van Oosterom P (1995) The GAP-tree, an approach to on-the-Fly map generalization of an area partitioning. In: Mueller JC, Lagrange JP, Weibel R (eds) GIS and generalization, methodology and practice. Taylor & Francis, pp 120–132

    Google Scholar 

  • van Oosterom P (2005) Variable-scale topological datastructures suitable for progressive data transfer: the GAP-face tree and GAP-edge forest. Cartogr Geogr Inf Sci 32(4):331–346

    Article  Google Scholar 

  • Whited B, Rossignac J (2011) Ball-Morph: definition, implementation, and comparative evaluation. IEEE Trans Vis Comput Graph 17(6):757–769

    Article  Google Scholar 

Download references

Acknowledgments

The authors thank Thomas C. van Dijk for proofreading an earlier version of this paper and the China Scholarship Council (CSC) for (partly) supporting this work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dongliang Peng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Peng, D., Wolff, A., Haunert, JH. (2016). Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations. In: Sarjakoski, T., Santos, M., Sarjakoski, L. (eds) Geospatial Data in a Changing World. Lecture Notes in Geoinformation and Cartography. Springer, Cham. https://doi.org/10.1007/978-3-319-33783-8_23

Download citation

Publish with us

Policies and ethics