@inproceedings{haunertwolff2010,
  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^6)$ 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.},
  added-at = {2011-11-07T12:01:05.000+0100},
  author = {Haunert, J.-H. and Wolff, A.},
  biburl = {https://www.bibsonomy.org/bibtex/209d394785e27481bff5cd884a42c844e/haunert},
  booktitle = {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},
  editor = {Abbadi, A. E. and Agrawal, D. and Mokbel, M. and Zhang, P.},
  interhash = {0394bab4d1dd4ed23bc660c3ea38e215},
  intrahash = {09d394785e27481bff5cd884a42c844e},
  keywords = {map_generalization simplification buildings myown mykeypub integer_programming},
  pages = {192--201},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/haunert/pdf/HaunertWolff2010.pdf},
  timestamp = {2011-11-07T12:01:05.000+0100},
  title = {Optimal and Topologically Safe Simplification of Building Footprints},
  url = {http://dl.acm.org/citation.cfm?doid=1869790.1869819},
  year = 2010
}