The importance of computational geometry for digital cartography

Authors

  • Tomáš Bayer Faculty of Science, Charles University in Prague

DOI:

https://doi.org/10.14311/gi.3.2

Keywords:

computational geometry, digital cartography, open source, GIS, automated generalization, convex hull

Abstract

This paper describes the use of computational geometry concepts in the digital cartography.  It presents an importance of 2D geometric structures, geometric operations and procedures for automated or semi automated simplification process. This article is focused on automated building simplification procedures, some techniques are illustrated and discussed. Concrete examples with the requirements to the lowest time complexity, emphasis on the smallest area enclosing rectangle, convex hull or self intersection procedures, are given. Presented results illustrate the relationship of digital cartography and computational geometry.

References

DE BERG M., SCHWARZKOPF O., KREVELD M., OVERMARS M.: Computational geometry: Algorithms and applications, 2000, Springer-Verlag.

DUTTER M.: Generalization of buildings derived from high resolution remote sensing data, 2007.

ROURKE O. J.: Computational geometry in C, 2005, Cambridge University Press.

SESTER M.: Generalization based on least square adjustment, International Archieves of Photogrammetry and Remote Sensing, 2000.

TOUSSAND G., Solving Geometric Problems with the Rotating Calipers, McGill University Montreal, 1983

Downloads

Published

2008-04-12

Issue

Section

Articles