Skip to main content

Area-Preserving Subdivision Schematization

  • Conference paper
Geographic Information Science (GIScience 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6292))

Included in the following conference series:

Abstract

We describe an area-preserving subdivision schematization algorithm: the area of each region in the input equals the area of the corresponding region in the output. Our schematization is axis-aligned, the final output is a rectilinear subdivision. We first describe how to convert a given subdivision into an area-equivalent rectilinear subdivision. Then we define two area-preserving contraction operations and prove that at least one of these operations can always be applied to any given simple rectilinear polygon. We extend this approach to subdivisions and showcase experimental results. Finally, we give examples for standard distance metrics (symmetric difference, Hausdorff- and Fréchet-distance) that show that better schematizations might result in worse shapes.

B. Speckmann is supported by the Netherlands Organisation for Scientific Research (NWO) under project no. 639.022.707.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cabello, S., de Berg, M., van Kreveld, M.: Schematization of networks. Computational Geometry: Theory and Applications 30(3), 223–238 (2005)

    MATH  MathSciNet  Google Scholar 

  2. Nöllenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 321–333. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Swan, J., Anand, S., Ware, M., Jackson, M.: Automated schematization for web service applications. In: Ware, J.M., Taylor, G.E. (eds.) W2GIS 2007. LNCS, vol. 4857, pp. 216–226. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Damen, J., van Kreveld, M., Spaan, B.: High quality building generalization by extending morphological operators. In: 11th ICA Workshop on Generalization and Multiple Representation, Montpellier, France (2008)

    Google Scholar 

  5. Lamy, S., Ruas, A., Demazeau, Y., Jackson, M., Mackaness, W., Weibel, R.: The application of agents in automated map generalisation. In: 19th International Cartographic Conference (1999)

    Google Scholar 

  6. Sester, M.: Generalization based on least squares adjustment. ISPRS - International Archives of Photogrammetry and Remote Sensing 13, 931–938 (2000)

    Google Scholar 

  7. Yan, H., Weibel, R., Yang, B.: A multi-parameter approach to automated building grouping and generalization. GeoInformatica 12, 73–89 (2008)

    Article  Google Scholar 

  8. Mayer, H.: Scale-spaces for generalization of 3d buildings. International Journal of Geographical Information Science 19, 975–997 (2005)

    Article  Google Scholar 

  9. Regnauld, N., Edwardes, A., Barrault, M.: Strategies in building generalisation: modelling the sequence, constraining the choice. In: ICA Workshop on Progress in Automated Map Generalization, Ottawa, Canada (1999)

    Google Scholar 

  10. Ruas, A.: Modèle de généralisation de données géographiques à base de contraintes et d’autonomie. PhD thesis, Université de Marne la Vallée (1999)

    Google Scholar 

  11. Haunert, J.H., Wolff, A.: Optimal simplification of building ground plans. In: Proceedings of XXIst ISPRS Congress Beijing 2008. IAPRS, vol. XXXVII (Part B2), pp. 372–378 (2008)

    Google Scholar 

  12. Sester, M.: Optimization approaches for generalization and data abstraction. International Journal of Geographical Information Science 19, 871–897 (2005)

    Article  Google Scholar 

  13. Bose, P., Cabello, S., Cheong, O., Gudmundsson, J., van Kreveld, M., Speckmann, B.: Area-preserving approximations of polygonal paths. Journal of Discrete Algorithms 4(4), 554–566 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  14. de Berg, M., van Kreveld, M., Schirra, S.: A new approach to subdivision simplification. Proceedings of Auto-Carto 12, 79–88 (1995)

    Google Scholar 

  15. de Berg, M., van Kreveld, M., Schirra, S.: Topologically correct subdivision simplification using the bandwidth criterion. Cartography and Geographic Information Science 25(4), 243–257 (1998)

    Article  Google Scholar 

  16. Estkowski, R., Mitchell, J.S.B.: Simplifying a polygonal subdivision while keeping it simple. In: 17th Symposium on Computational Geometry, pp. 40–49 (2001)

    Google Scholar 

  17. van de Kraats, B., van Kreveld, M., Overmars, M.: Printed circuit board simplification: simplifying subdivisions in practice. In: 11th Symposium on Computational Geometry, pp. 430–431 (1995)

    Google Scholar 

  18. Guibas, L., Hershberger, J., Mitchell, J., Snoeyink, J.: Approximating polygons and subdivisions with minimum-link paths. International Journal of Computational Geometry and Applications 3, 383–415 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meulemans, W., van Renssen, A., Speckmann, B. (2010). Area-Preserving Subdivision Schematization. In: Fabrikant, S.I., Reichenbacher, T., van Kreveld, M., Schlieder, C. (eds) Geographic Information Science. GIScience 2010. Lecture Notes in Computer Science, vol 6292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15300-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15300-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15299-3

  • Online ISBN: 978-3-642-15300-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics