Deutsch Intern
Chair of Computer Science I - Algorithms and Complexity

Simplification of Building Footprints

When simplifying a polygon, the number of polygon vertices has to be reduced while the dominant shape characteristics have to be preserved. A typical characteristic of polygons representing buildings is rectilinearity, that is, all (or most) angles of the polygons are close to 90 degrees. Furthermore, neighborhood relations between different buildings are important and thus must not be lost during simplification. We approach the simplification of building footprints by optimization and develop an approach by mathematical programming and heuristics, which is similar to our approach for area aggregation.

Buildings often contain symmetric structures, which humans perceive as characteristic features. Our aim is to preserve symmetries and, therefore, we first deal with the problem of detecting symmetries.


Optimal and Topologically Safe Simplification of Building Footprints.
In: A. E. Abbadi, D. Agrawal, M. Mokbel und P. Zhang, editors, Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM-GIS'10), November 2-5, 2010, San Jose, CA, USA, pages 192-201. 2010.
J.-H. Haunert and A. Wolff.
[doi] [PDF][BibTeX]

Detecting Symmetries in Building Footprints by String Matching.
In: S. Geertman, W. Reinhardt and F. Toppen, editors, Advancing Geoinformation Science for a Changing World - Proc. 14th AGILE International Conference on Geographic Information Science, series Lecture Notes in Geoinformation and Cartography, pages 319-336. Springer, Berlin, Germany, 2011.
J.-H. Haunert.
[doi] [PDF] [BibTeX]