research-article

Optimal and topologically safe simplification of building footprints

Authors:

Jan-Henrik Haunert,

Alexander WolffAuthors Info & Claims

GIS '10: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

Pages 192 - 201

https://doi.org/10.1145/1869790.1869819

Published: 02 November 2010 Publication History

Abstract

We present an optimization approach to simplify sets of building footprints represented as polygons. We simplify each polygonal ring by selecting a subsequence of its original edges; the vertices of the simplified ring are defined by intersections of consecutive (and possibly extended) edges in the selected sequence. Our aim is to minimize the number of all output edges subject to a user-defined error tolerance. Since we earlier showed that the problem is NP-hard when requiring non-intersecting simple polygons as output, we cannot hope for an efficient, exact algorithm. Therefore, we present an efficient algorithm for a relaxed problem and an integer program (IP) that allows us to solve the original problem with existing software. Our IP is large, since it has O(m⁶) constraints, where m is the number of input edges. In order to keep the running time small, we first consider a subset of only O(m) constraints. The choice of the constraints ensures some basic properties of the solution. Constraints that were neglected are added during optimization whenever they become violated by a new solution encountered. Using this approach we simplified a set of 144 buildings with a total of 2056 edges in 4.1 seconds on a standard desktop PC; the simplified building set contained 762 edges. During optimization, the number of constraints increased by a mere 13%. We also show how to apply cartographic quality measures in our method and discuss their effects on examples.

References

[1]

S. Bard. Quality assessment of cartographic generalization. Trans. GIS, 8(1):63--81, 2004.

[2]

P. Bose, S. Cabello, O. Cheong, J. Gudmundsson, M. van Krefeld, and B. Speckmann. Area-preserving approximations of polygonal paths. J. Discrete Algorithms, 4:554--556, 2006.

Digital Library

[3]

G. M. Campbell and R. G. Cromley. Optimal simplification of cartographic lines using shortest-path formulations. J. Oper. Res. Soc., 42(9):793--802, 1991.

[4]

D. Chen, O. Daescu, J. Hershberger, P. Kogge, N. Mi, and J. Snoeyink. Polygonal path simplification with angle constraints. Comp. Geom. Theor. Appl., 32(3):173--187, 2005.

Digital Library

[5]

J. Damen, M. van Kreveld, and B. Spaan. High quality building generalization by extending the morphological operators. In Proc. 11th ICA Workshop Generalisation and Multiple Representation, 2008.

[6]

M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer, Berlin, Germany, 2008.

Digital Library

[7]

M. de Berg, M. van Kreveld, and S. Schirra. Topologically correct subdivision simplification using the bandwidth criterion. Cartography & GIS, 25(4):243--257, 1998.

[8]

T. Deveau. Reducing the number of points in a plane curve representation. In Proc. Auto-Carto VII, pages 152--160, 1985.

[9]

Y. Filippovska, V. Walter, and D. Fritsch. Quality evaluation of generalization algorithms. In Proc. XXIst ISPRS Congress, volume 37 (part B2) of Internat. Archives Photogrammetry, Remote Sensing and Spatial Inform. Sci., pages 799--804, 2008.

[10]

J. Gudmundsson, G. Narasimhan, and M. Smid. Distance-preserving approximations of polygonal paths. Comp. Geom. Theor. Appl., 36(3):183--196, 2007.

Digital Library

[11]

J.-H. Haunert. Aggregation in Map Generalization by Combinatorial Optimization. Dissertation, Leibniz Universität Hannover, Germany, 2009.

[12]

J.-H. Haunert and A. Wolff. Generalization of land cover maps by mixed integer programming. In Proc. 14th Annu. ACM Sympos. Advances in Geograph. Inform. Syst. (ACM GIS'06), pages 75--82, 2006.

Digital Library

[13]

J.-H. Haunert and A. Wolff. Optimal simplification of building ground plans. In Proc. XXIst ISPRS Congress, volume 37 (part B2) of Internat. Archives Photogrammetry, Remote Sensing and Spatial Inform. Sci., pages 373--378, 2008.

[14]

A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM J. Comput., 7(4):413--423, 1978.

Digital Library

[15]

M. Kada and F. Luo. Generalisation of building ground plans using half-spaces. In Proc. ISPRS Commission IV Sympos. Geospatial Databases for Sustainable Development, volume 36 (part 4) of Internat. Archives Photogrammetry, Remote Sensing and Spatial Inform. Sci., 2006.

[16]

H. Mayer. Model-generalization of building outlines based on scale-spaces and scale-space events. In Proc. ISPRS Commission III Sympos. Object Recognition and Scene Classification from Multispatial and Multisensor Pixels, volume 37 (part 3) of Internat. Archives Photogrammetry, Remote Sensing and Spatial Inform. Sci., pages 530--536, 1998.

[17]

J. E. Mitchell. Branch-and-cut algorithms for combinatorial optimization problems. In P. M. Pardalos and M. G. C. Resende, editors, Handbook of Applied Optimization, pages 65--77. Oxford University Press, Oxford, UK, 2002.

[18]

N. Regnauld. Contextual building typification in automated map generalization. Algorithmica, 30(2):312--333, 2001.

Digital Library

[19]

M. Sester. Optimization approaches for generalization and data abstraction. Int. J. Geogr. Inf. Sci., 19(8--9):871--897, 2005.

[20]

W. Staufenbiel. Zur Automation der Generalisierung topographischer Karten mit besonderer Berücksichtigung großmaßstäbiger Gebäudedarstellungen. Dissertation, Technische Universität Hannover, Germany, 1973.

[21]

S. Steiniger, P. Taillandier, and R. Weibel. Utilising urban context recognition and machine learning to improve the generalisation of buildings. Int. J. Geogr. Inf. Sci., 24(2):253--282, 2010.

Digital Library

Cited By

Yan XYang M(2023)A deep learning approach for polyline and building simplification based on graph autoencoder with flexible constraintsCartography and Geographic Information Science10.1080/15230406.2023.221810651:1(79-96)Online publication date: 13-Jun-2023
https://doi.org/10.1080/15230406.2023.2218106
Bonerath AHaunert JMitchell JNiedermann B(2023)Shortcut hulls: Vertex-restricted outer simplifications of polygonsComputational Geometry10.1016/j.comgeo.2023.101983112(101983)Online publication date: Jun-2023
https://doi.org/10.1016/j.comgeo.2023.101983
Huang YJin Y(2022)Aerial Imagery-Based Building Footprint Detection with an Integrated Deep Learning Framework: Applications for Fine Scale Wildland–Urban Interface MappingRemote Sensing10.3390/rs1415362214:15(3622)Online publication date: 28-Jul-2022
https://doi.org/10.3390/rs14153622
Show More Cited By

Index Terms

Optimal and topologically safe simplification of building footprints

Recommendations

A new method for subdivision simplification with applications to urban-area generalization
GIS '11: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

We introduce a local operation for polygons and subdivisions called an edge-move. Edge-moves do not change the edge orientations present in the input and are thus suitable for iterative simplification or even schematization. Based on edge-moves we ...
Consistency Cuts for Dantzig-Wolfe Reformulations
A New Family of Valid-Inequalities for Dantzig-Wolfe Reformulation of Mixed Integer Linear Programs
In “Consistency Cuts for Dantzig-Wolfe Reformulation,” Jens Vinther Clausen, Richard Lusby, and Stefan Ropke present a new family of valid inequalities to ...
This paper introduces a family of valid inequalities, which we term consistency cuts, to be applied to a Dantzig-Wolfe reformulation (or decomposition) with linking variables. We prove that these cuts ensure an integer solution to the corresponding ...
An efficient compact quadratic convex reformulation for general integer quadratic programs

We address the exact solution of general integer quadratic programs with linear constraints. These programs constitute a particular case of mixed-integer quadratic programs for which we introduce in Billionnet et al. (Math. Program., 2010) a general ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GIS '10: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 2010

566 pages

ISBN:9781450304283

DOI:10.1145/1869790

General Chairs:
Divyakant Agrawal
University of California at Santa Barbara
,
Pusheng Zhang
Microsoft Corporation
,
Program Chairs:
Amr El Abbadi
University of California, Santa Barbara
,
Mohamed Mokbel
University of Minnesota

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSPATIAL: ACM Special Interest Group on Spatial Information

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GIS '10

Sponsor:

SIGSPATIAL

GIS '10: 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems

November 2 - 5, 2010

California, San Jose

Acceptance Rates

Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
251
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yan XYang M(2023)A deep learning approach for polyline and building simplification based on graph autoencoder with flexible constraintsCartography and Geographic Information Science10.1080/15230406.2023.221810651:1(79-96)Online publication date: 13-Jun-2023
https://doi.org/10.1080/15230406.2023.2218106
Bonerath AHaunert JMitchell JNiedermann B(2023)Shortcut hulls: Vertex-restricted outer simplifications of polygonsComputational Geometry10.1016/j.comgeo.2023.101983112(101983)Online publication date: Jun-2023
https://doi.org/10.1016/j.comgeo.2023.101983
Huang YJin Y(2022)Aerial Imagery-Based Building Footprint Detection with an Integrated Deep Learning Framework: Applications for Fine Scale Wildland–Urban Interface MappingRemote Sensing10.3390/rs1415362214:15(3622)Online publication date: 28-Jul-2022
https://doi.org/10.3390/rs14153622
Amiraghdam ADiehl APajarola R(2022)LOOPS: LOcally Optimized Polygon SimplificationComputer Graphics Forum10.1111/cgf.1454641:3(355-365)Online publication date: 12-Aug-2022
https://doi.org/10.1111/cgf.14546
Skeba PSaxena DGuha SBaumer E(2021)Who has a Choice?: Survey-Based Predictors of Volitionality in Facebook Use and Non-useProceedings of the ACM on Human-Computer Interaction10.1145/34639355:GROUP(1-25)Online publication date: 13-Jul-2021
https://dl.acm.org/doi/10.1145/3463935
Kyono TGilbert FSchaar M(2021)Triage of 2D Mammographic Images Using Multi-view Multi-task Convolutional Neural NetworksACM Transactions on Computing for Healthcare10.1145/34531662:3(1-24)Online publication date: 15-Jul-2021
https://dl.acm.org/doi/10.1145/3453166
Shen JRinard M(2021)Active Learning for Inference and Regeneration of Applications that Access DatabasesACM Transactions on Programming Languages and Systems10.1145/343095242:4(1-119)Online publication date: 22-Jan-2021
https://dl.acm.org/doi/10.1145/3430952
Forsch ADehbi YNiedermann BOehrlein JRottmann PHaunert J(2021)Multimodal travel‐time maps with formally correct and schematic isochronesTransactions in GIS10.1111/tgis.1282125:6(3233-3256)Online publication date: 31-Aug-2021
https://doi.org/10.1111/tgis.12821
Wang XBurghardt D(2021)Hierarchical Extraction of Skeleton Structures from Discrete BuildingsThe Cartographic Journal10.1080/00087041.2020.185251258:3(268-289)Online publication date: 28-Jul-2021
https://doi.org/10.1080/00087041.2020.1852512
Peng DWolff AHaunert J(2020)Finding Optimal Sequences for Area Aggregation—A⋆ vs. Integer Linear ProgrammingACM Transactions on Spatial Algorithms and Systems10.1145/34092907:1(1-40)Online publication date: 14-Oct-2020
https://dl.acm.org/doi/10.1145/3409290
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents