BibReference.bib

% Encoding: GBK

@Article{Aldaz2015,
  author    = {Aldaz, J. M. and Barza, S. and Fujii, M. and Moslehian, M. S.},
  title     = {Advances in operator {Cauchy}--{Schwarz} inequalities and their reverses},
  journal   = {Annals of Functional Analysis},
  year      = {2015},
  volume    = {6},
  number    = {3},
  pages     = {275--295},
  doi       = {10.15352/afa/06-3-20},
  owner     = {Dongliang},
  publisher = {Duke University Press},
  timestamp = {2017.04.28},
}

@InProceedings{Anders2006Grid,
  author    = {Anders, Karl-Heinrich},
  booktitle = {Proc.\ 12th International Symposium on Spatial Data Handling ({SDH})},
  title     = {Grid Typification},
  year      = {2006},
  address   = {Berlin, Heidelberg},
  editor    = {Riedl, Andreas and Kainz, Wolfgang and Elmes, Gregory A.},
  pages     = {633--642},
  publisher = {Springer Berlin Heidelberg},
  abstract  = {In this paper the detection and typification of grid structures in building groups is described. Typification is a generalization operation that replaces a large number of similar objects by a smaller number of objects, while preserving the global structure of the object distribution. The typification approach is based on three processes. First the grid structures are detected based on the so-called relative neighborhood graph. Second the detected grid structures are regularized by a least square adjustment of an affine or Helmert transformation. The third process is the reduction or simplification of the grid structure, which can be done using the same affine or Helmert transformation approach.},
  doi       = {10.1007/3-540-35589-8_40},
  isbn      = {978-3-540-35589-2},
  url       = {https://doi.org/10.1007/3-540-35589-8_40},
}

@Article{Arkin1991,
  author    = {Arkin, Esther M. and Chew, L. Paul and Huttenlocher, Daniel P. and Kedem, Klara and Mitchell, Joseph S. B.},
  title     = {An Efficiently Computable Metric for Comparing Polygonal Shapes},
  journal   = {{IEEE} Transactions on Pattern Analysis and Machine Intelligence},
  year      = {1991},
  volume    = {13},
  number    = {3},
  pages     = {209--216},
  added-at  = {2016-03-12T00:00:00.000+0100},
  biburl    = {https://www.bibsonomy.org/bibtex/291474a019fbaf6904020949ac4af3e1b/dblp},
  doi       = {10.1109/34.75509},
  ee        = {http://doi.ieeecomputersociety.org/10.1109/34.75509},
  interhash = {6c3d07a11edc0d78e0b7fbd68dbad7de},
  intrahash = {91474a019fbaf6904020949ac4af3e1b},
  keywords  = {dblp},
  owner     = {Dongliang},
  timestamp = {2016-03-15T11:57:55.000+0100},
}

@Article{AronovSS93,
  author    = {Aronov, Boris and Seidel, Raimund and Souvaine, Diane L.},
  title     = {On compatible triangulations of simple polygons},
  journal   = {Computational Geometry},
  year      = {1993},
  volume    = {3},
  pages     = {27--35},
  doi       = {10.1016/0925-7721(93)90028-5},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@InProceedings{BabikovSW97,
  author    = {Mark Babikov and Diane L. Souvaine and Rephael Wenger},
  title     = {Constructing piecewise linear homeomorphisms of polygons with holes},
  booktitle = {Proc.\\ 9th {Canadian} Conference on Computational Geometry ({CCCG})},
  year      = {1997},
  pages     = {6--10},
  address   = {Kingston, Ontario, Canada},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.cccg.ca/proceedings/1997/cccg1997.pdf},
}

@PhdThesis{Bader2001Dissertation,
  author  = {Matthias Bader},
  title   = {Energy Minimization Methods for Feature Displacement in Map Generalization},
  school  = {University of Z{\"u}rich},
  year    = {2001},
  type    = {phdthesis},
  address = {Z{\"u}rich, Switzerland},
  url     = {https://www.geo.uzh.ch/dam/jcr:2c2e14d7-7754-41fe-81b6-fbd6c75b2aed/thesis_MatsBader_2001.pdf},
}

@Article{Basaraner2008,
  author    = {Melih Basaraner and Mehmet Selcuk},
  title     = {A Structure Recognition Technique in Contextual Generalisation of Buildings and Built-up Areas},
  journal   = {The Cartographic Journal},
  year      = {2008},
  volume    = {45},
  number    = {4},
  pages     = {274--285},
  doi       = {10.1179/174327708X347773},
  eprint    = {http://dx.doi.org/10.1179/174327708X347773},
  owner     = {Dongliang},
  timestamp = {2017.08.24},
}

@InProceedings{Beeri2005,
  author    = {Beeri, Catriel and Doytsher, Yerach and Kanza, Yaron and Safra, Eliyahu and Sagiv, Yehoshua},
  title     = {Finding Corresponding Objects when Integrating Several Geo-spatial Datasets},
  booktitle = {Proc.\ 13th Annual {ACM} International Workshop on Geographic Information Systems},
  year      = {2005},
  pages     = {87--96},
  address   = {Bremen, Germany},
  acmid     = {1097078},
  comment   = {10.1145/1097064.1097078},
  doi       = {10/dhfprh},
  isbn      = {1-59593-146-5},
  keywords  = {corresponding objects, geospatial datasets, integration, location-based join, spatial join},
  numpages  = {10},
  owner     = {Dongliang},
  timestamp = {2017.10.17},
  url       = {http://doi.acm.org/10.1145/1097064.1097078},
}

@Article{Bentley1979,
  author    = {J. L. Bentley and T. A. Ottmann},
  title     = {Algorithms for Reporting and Counting Geometric Intersections},
  journal   = {{IEEE} Transactions on Computers},
  year      = {1979},
  volume    = {C-28},
  number    = {9},
  pages     = {643--647},
  issn      = {0018-9340},
  comment   = {Sept},
  doi       = {10.1109/TC.1979.1675432},
  keywords  = {Computational geometry;geometric intersection problems;Application software;Computer graphics;Computer science;Conductors;Geometry;Integrated circuit synthesis;Linear programming;Object detection;Operations research;Printed circuits;Computational geometry;geometric intersection problems},
  owner     = {Dongliang},
  timestamp = {2017.10.17},
}

@Article{Bentley1980,
  author    = {Jon Louis Bentley and James B Saxe},
  title     = {Decomposable searching problems I. Static-to-dynamic transformation},
  journal   = {Journal of Algorithms},
  year      = {1980},
  volume    = {1},
  number    = {4},
  pages     = {301--358},
  issn      = {0196-6774},
  comment   = {https://doi.org/10.1016/0196-6774(80)90015-2},
  doi       = {10.1016/0196-6774(80)90015-2},
  owner     = {Dongliang},
  timestamp = {2017.10.19},
  url       = {http://www.sciencedirect.com/science/article/pii/0196677480900152},
}

@Article{Bentley1980Closest,
  author     = {Bentley, Jon Louis and Weide, Bruce W. and Yao, Andrew C.},
  title      = {Optimal Expected-Time Algorithms for Closest Point Problems},
  journal    = {ACM Transactions on Mathematical Software},
  year       = {1980},
  volume     = {6},
  number     = {4},
  pages      = {563--580},
  issn       = {0098-3500},
  acmid      = {355927},
  address    = {New York, NY, USA},
  comment    = {#dec#},
  doi        = {10.1145/355921.355927},
  issue_date = {Dec. 1980},
  numpages   = {18},
  owner      = {Dongliang},
  publisher  = {ACM},
  timestamp  = {2017.10.20},
  url        = {http://doi.acm.org/10.1145/355921.355927},
}

@InProceedings{Bentley1977Multivariate,
  author    = {Jon Louis Bentley and Michael Ian Shamos and Jon Louis Bentley and Michael Ian Shamos},
  title     = {A problem in multivariate statistics: {Algorithm}, data structure, and applications},
  booktitle = {Proc.\ 15th Allerton Conference on Communication, Control, and Computing},
  year      = {1977},
  pages     = {193--201},
  address   = {Monticello, IL, USA},
  month     = sep,
  comment   = {September 28-30},
  owner     = {Dongliang},
  timestamp = {2017.10.20},
  url       = {http://www.dtic.mil/docs/citations/ADA055818},
}

@Article{Bereg2005,
  author    = {Sergey Bereg},
  title     = {An approximate morphing between polylines},
  journal   = {International Journal of Computational Geometry \& Applications},
  year      = {2005},
  volume    = {15},
  number    = {2},
  pages     = {193--208},
  doi       = {10.1142/S0218195905001658},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@InProceedings{Boffet2000,
  author    = {Annabelle Boffet},
  title     = {Creating urban information for cartographic generalisation},
  booktitle = {Proc.\ 9th International Symposium on Spatial Data Handling {(SDH)}, Advances in {GIS} Research {III}},
  year      = {2000},
  editor    = {Pip Forer and Anthony Yeh and Jianbang He},
  series    = {Lecture Notes in Geoinformation and Cartography},
  address   = {Beijing, China},
  publisher = {Springer},
  comment   = {August 10--12
http://recherche.ign.fr/labos/util_basilic/publicDownload.php?id=3284},
  owner     = {Dongliang},
  pagetotal = {19},
  timestamp = {2017.09.21},
  url       = {http://recherche.ign.fr/labos/util_basilic/publicDownload.php?id=3284},
}

@Article{BoxMuller1958,
  author    = {Box, G. E. P. and Muller, Mervin E.},
  title     = {A Note on the Generation of Random Normal Deviates},
  journal   = {The Annals of Mathematical Statistics},
  year      = {1958},
  volume    = {29},
  number    = {2},
  pages     = {610--611},
  month     = {06},
  comment   = {Ann\. Math\. Statist.},
  doi       = {10.1214/aoms/1177706645},
  publisher = {The Institute of Mathematical Statistics},
  url       = {https://doi.org/10.1214/aoms/1177706645},
}

@Book{bradley1977applied,
  title     = {Applied Mathematical Programming},
  publisher = {Addison-Wesley Publishing Company},
  year      = {1977},
  author    = {Bradley, Stephen P. and Hax, Arnoldo C. and Magnanti, Thomas L.},
  isbn      = {9780201004649},
  lccn      = {76010426},
  owner     = {Dongliang},
  timestamp = {2017.09.25},
  url       = {http://web.mit.edu/15.053/www/AMP.htm},
}

@Article{Brewer2007Guidelines,
  author    = {Brewer, Cynthia A. and Buttenfield, Barbara P.},
  title     = {Framing Guidelines for Multi-Scale Map Design Using Databases at Multiple Resolutions},
  journal   = {Cartography and Geographic Information Science},
  year      = {2007},
  volume    = {34},
  number    = {1},
  pages     = {3--15},
  doi       = {10/dm5jj6},
  eprint    = {https://doi.org/10.1559/152304007780279078},
  publisher = {Taylor \& Francis},
  url       = {http://doi.org/dm5jj6},
}

@Article{Brewer2003Print,
  author    = {Cynthia A. Brewer and Geoffrey W. Hatchard and Mark A. Harrower},
  title     = {ColorBrewer in Print: {A} Catalog of Color Schemes for Maps},
  journal   = {Cartography and Geographic Information Science},
  year      = {2003},
  volume    = {30},
  number    = {1},
  pages     = {5--32},
  comment   = {10.1559/152304003100010929
 https://doi.org/10.1559/152304003100010929},
  doi       = {10/df3png},
  eprint    = {https://doi.org/10.1559/152304003100010929},
  publisher = {Taylor \& Francis},
  url       = {http://doi.org/df3png},
}

@Book{Bronstein2015,
  title     = {Handbook of Mathematics},
  publisher = {Springer-Verlag Berlin Heidelberg},
  year      = {2015},
  author    = {Ilja N. Bronstein and Konstantin A. Semendjajew and Gerhard Musiol and Heiner M{\"u}hlig},
  edition   = {6},
  isbn      = {978-3-662-46220-1},
  doi       = {10.1007/978-3-662-46221-8},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.springer.com/de/book/9783835101234},
}

@InProceedings{Buchin2009_Delaunay,
  author    = {Kevin Buchin},
  title     = {Constructing {D}elaunay Triangulations along Space-Filling Curves},
  booktitle = {Proc.\ 17th Annual European Symposium on Algorithms ({ESA})},
  year      = {2009},
  editor    = {Fiat, Amos and Sanders, Peter},
  volume    = {5757},
  series    = {Lecture Notes in Computer Science},
  pages     = {119--130},
  address   = {Copenhagen, Denmark},
  month     = sep,
  publisher = {Springer},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/esa/Buchin09},
  comment   = {10.1007/978-3-642-04128-0_11,
September 7--9},
  doi       = {10/bt8qfk},
  owner     = {Dongliang},
  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
  url       = {https://doi.org/10.1007/978-3-642-04128-0_11},
}

@Article{Buchin2016,
  author     = {Buchin, Kevin and Meulemans, Wouter and van Renssen, Andr{\'e} and Speckmann, Bettina},
  title      = {Area-Preserving Simplification and Schematization of Polygonal Subdivisions},
  journal    = {ACM Transactions on Spatial Algorithms and Systems},
  year       = {2016},
  volume     = {2},
  number     = {1},
  pages      = {2:1--2:36},
  month      = apr,
  issn       = {2374-0353},
  acmid      = {2818373},
  address    = {New York, NY, USA},
  articleno  = {2},
  doi        = {10.1145/2818373},
  issue_date = {April 2016},
  keywords   = {Simplification, area preservation, orientation restriction, schematization, territorial outlines},
  numpages   = {36},
  owner      = {Dongliang},
  publisher  = {ACM},
  timestamp  = {2017.04.28},
  url        = {http://doi.acm.org/10.1145/2818373},
}

@InProceedings{Buchin2011_Simp,
  author    = {Buchin, Kevin and Meulemans, Wouter and Speckmann, Bettina},
  title     = {A new method for subdivision simplification with applications to urban-area generalization.},
  booktitle = {Proc.\ 19th {ACM SIGSPATIAL} International Conference on Advances in Geographic Information Systems ({ACMGIS})},
  year      = {2011},
  editor    = {Cruz, Isabel F. and Agrawal, Divyakant and Jensen, Christian S. and Ofek, Eyal and Tanin, Egemen},
  pages     = {261--270},
  address   = {Chicago, IL, USA},
  added-at  = {2012-01-13T00:00:00.000+0100},
  biburl    = {https://www.bibsonomy.org/bibtex/236e061d5b8422402f834d426da29bcde/dblp},
  comment   = {http://dblp.uni-trier.de/db/conf/gis/gis2011.html#BuchinMS11},
  doi       = {10.1145/2093973.2094009},
  interhash = {bc0d48f2108da75c6482c763606a7815},
  intrahash = {36e061d5b8422402f834d426da29bcde},
  isbn      = {978-1-4503-1031-4},
  keywords  = {dblp},
  owner     = {Dongliang},
  timestamp = {2012-01-26T11:35:01.000+0100},
}

@Article{Burghardt2005Snakes,
  author   = {Burghardt, Dirk},
  title    = {Controlled Line Smoothing by Snakes},
  journal  = {GeoInformatica},
  year     = {2005},
  volume   = {9},
  number   = {3},
  pages    = {237--252},
  month    = sep,
  issn     = {1573-7624},
  abstract = {A major focus of research in recent years has been the development of algorithms for automated line smoothing. However, combination of the algorithms with other generalization operators is a challenging problem. In this research a key aim was to extend a snakes optimization approach, allowing displacement of lines, to also be used for line smoothing. Furthermore, automated selection of control parameters is important for fully automated solutions. An existing approach based on line segmentation was used to control the selection of smoothing parameters dependent on object characteristics. Additionally a new typification routine is presented, which uses the same preprocessed analysis for the segmentation of lines to find suitable candidates from curve bends. The typification is realized by deleting undersized bends and emphasizing the remaining curve bends. The main results of this research are two new algorithms for line generalization, where the importance of the line smoothing algorithm lies in the usage of a optimization approach which can also be used for line displacement.},
  comment  = {10.1007/s10707-005-1283-3},
  day      = {01},
  doi      = {10/dfjwz5},
  url      = {https://doi.org/10.1007/s10707-005-1283-3},
}

@PhdThesis{Cecconi2003,
  author    = {Cecconi, Alessandro},
  title     = {Integration of cartographic generalization and multi-scale databases for enhanced web mapping},
  school    = {Universit{\"a}t Z{\"u}rich, Switzerland},
  year      = {2003},
  type      = {phdthesis},
  comment   = {10.3929/ethz-a-004553772},
  doi       = {10/c5kd},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.researchcollection.ethz.ch/handle/20.500.11850/147473},
}

@Article{Cecconi2002,
  author    = {Cecconi, Alesandro and Galanda, Martin},
  title     = {Adaptive zooming in web cartography},
  journal   = {Computer Graphics Forum},
  year      = {2002},
  volume    = {21},
  number    = {4},
  pages     = {787--799},
  doi       = {10.1111/1467-8659.00636},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Cetinkaya2015,
  author    = {Sinan Cetinkaya and Melih Basaraner and Dirk Burghardt},
  title     = {Proximity-based grouping of buildings in urban blocks: a comparison of four algorithms},
  journal   = {Geocarto International},
  year      = {2015},
  volume    = {30},
  number    = {6},
  pages     = {618--632},
  doi       = {10.1080/10106049.2014.925002},
  eprint    = {http://dx.doi.org/10.1080/10106049.2014.925002},
  owner     = {Dongliang},
  timestamp = {2017.05.17},
  url       = {http://dx.doi.org/10.1080/10106049.2014.925002},
}

@Article{Chan1996,
  author    = {Chan, W.S. and Chin, F.},
  title     = {Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum Error},
  journal   = {International Journal of Computational Geometry \& Applications},
  year      = {1996},
  volume    = {06},
  number    = {01},
  pages     = {59--77},
  doi       = {10.1142/S0218195996000058},
  eprint    = {http://www.worldscientific.com/doi/pdf/10.1142/S0218195996000058},
  owner     = {Dongliang},
  timestamp = {2017.10.17},
  url       = {http://www.worldscientific.com/doi/abs/10.1142/S0218195996000058},
}

@InProceedings{Chan1992,
  author    = {Chan, W. S. and Chin, F.},
  title     = {Approximation of polygonal curves with minimum number of line segments},
  booktitle = {Proc.\ 3rd International Symposium on Algorithms and Computation {(ISAAC)}},
  year      = {1992},
  editor    = {Ibaraki, Toshihide and Inagaki, Yasuyoshi and Iwama, Kazuo and Nishizeki, Takao and Yamashita, Masafumi},
  volume    = {650},
  series    = {Lecture Notes in Computer Science},
  pages     = {378--387},
  address   = {Nagoya, Japan},
  publisher = {Springer},
  abstract  = {We improve the time complexity to solve the polygonal curve approximation problem formulated by Imai and Iri from O(n2 log n) to O(n2). If the curve to be approximated forms part of a convex polygon, we show that the time complexity can be further reduced to O(n).},
  comment   = {December 16--18},
  doi       = {10.1007/3-540-56279-6_90},
  isbn      = {978-3-540-47501-9},
  owner     = {Dongliang},
  timestamp = {2017.08.10},
  url       = {https://doi.org/10.1007/3-540-56279-6_90},
}

@Article{Chaudhry2008,
  author    = {Omair Chaudhry and William A. Mackaness},
  title     = {Automatic identification of urban settlement boundaries for multiple representation databases},
  journal   = {Computers, Environment and Urban Systems},
  year      = {2008},
  volume    = {32},
  number    = {2},
  pages     = {95--109},
  issn      = {0198-9715},
  doi       = {10.1016/j.compenvurbsys.2007.09.001},
  keywords  = {Urban modelling},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.sciencedirect.com/science/article/pii/S0198971507000713},
}

@Article{Chazal2010BallMap,
  author    = {Chazal, Fr{\'e}d{\'e}ric and Lieutier, Andr{\'e} and Rossignac, Jarek and Whited, Brian},
  title     = {Ball-map: {Homeomorphism} between compatible surfaces},
  journal   = {International Journal of Computational Geometry \& Applications},
  year      = {2010},
  volume    = {20},
  number    = {3},
  pages     = {285--306},
  comment   = {10.1142/S021819591000330X},
  doi       = {10/dnrwhn},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Cheng2006,
  author    = {Tao Cheng and Zhilin Li},
  title     = {Toward quantitative measures for the semantic quality of polygon generalization},
  journal   = {Cartographica},
  year      = {2006},
  volume    = {41},
  number    = {2},
  pages     = {487--499},
  doi       = {10.3138/0172-6733-227U-8155},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.utpjournals.press/doi/abs/10.3138/0172-6733-227U-8155},
}

@Article{CherkasskyGR96,
  author    = {Cherkassky, Boris V. and Goldberg, Andrew V. and Radzik, Tomasz},
  title     = {Shortest paths algorithms: theory and experimental evaluation},
  journal   = {Mathematical Programming},
  year      = {1996},
  volume    = {73},
  pages     = {129--174},
  month     = {May},
  issn      = {1436-4646},
  day       = {01},
  doi       = {10.1007/BF02592101},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://dblp.uni-trier.de/db/journals/mp/mp73.html#CherkasskyGR96},
}

@InProceedings{Chimani2014Eat,
  author    = {Chimani, Markus and van Dijk, Thomas C. and Haunert, Jan-Henrik},
  title     = {How to Eat a Graph: {Computing} selection sequences for the continuous generalization of road networks},
  booktitle = {Proc.\ 22nd {ACM SIGSPATIAL} International Conference on Advances in Geographic Information Systems ({ACMGIS})},
  year      = {2014},
  pages     = {243--252},
  address   = {Dallas, TX, USA},
  doi       = {10.1145/2666310.2666414},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://doi.acm.org/10.1145/2666310.2666414},
}

@Book{Choudhary1992Elements,
  title     = {The Elements of Complex Analysis},
  publisher = {New Age International},
  year      = {1992},
  author    = {Choudhary, B.},
  edition   = {2},
  isbn      = {9788122403992},
  lccn      = {lc93235836},
  owner     = {Dongliang},
  timestamp = {2017.12.12},
}

@Article{Connelly2003,
  author    = {Robert Connelly and Erik D. Demaine and G{\"u}nter Rote},
  title     = {Straightening Polygonal Arcs and Convexifying Polygonal Cycles},
  journal   = {Discrete \& Computational Geometry},
  year      = {2003},
  volume    = {30},
  number    = {2},
  pages     = {205--239},
  comment   = {10.1007/s00454-003-0006-7, September},
  doi       = {10/cv63dt},
  owner     = {Dongliang},
  timestamp = {2017.10.17},
  url       = {https://link.springer.com/article/10.1007/s00454-003-0006-7},
}

@Book{Cormen2009,
  title     = {Introduction to Algorithms},
  publisher = {The MIT Press},
  year      = {2009},
  author    = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford},
  edition   = {3},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://mitpress.mit.edu/books/introduction-algorithms-third-edition},
}

@Article{Cova2000_Contiguity,
  author    = {Cova, Thomas J. and Church, Richard L.},
  title     = {Contiguity Constraints for Single-Region Site Search Problems},
  journal   = {Geographical Analysis},
  year      = {2000},
  volume    = {32},
  number    = {4},
  pages     = {306--329},
  issn      = {1538-4632},
  doi       = {10.1111/j.1538-4632.2000.tb00430.x},
  owner     = {Dongliang},
  publisher = {Blackwell Publishing Ltd},
  timestamp = {2017.10.06},
  url       = {http://dx.doi.org/10.1111/j.1538-4632.2000.tb00430.x},
}

@InProceedings{Damen2008,
  author    = {Damen, Jonathan and van Kreveld, Marc and Spaan, Bert},
  title     = {High quality building generalization by extending the morphological operators},
  booktitle = {Proc.\ 12th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2008},
  address   = {Montpellier, France},
  month     = jun,
  added-at  = {2012-02-02T14:55:05.000+0100},
  biburl    = {http://www.bibsonomy.org/bibtex/2bebcb03a717f9adab79538f28de50194/juku},
  comment   = {June 20--21},
  interhash = {4aff3843ad3cba4e65ac1ca2d49b70f8},
  intrahash = {bebcb03a717f9adab79538f28de50194},
  owner     = {Dongliang},
  pagetotal = {12},
  timestamp = {2012-10-18T13:40:07.000+0200},
  url       = {https://bertspaan.nl/files/building-generalization.pdf},
}

@Article{Danciger2009,
  author   = {Danciger, Jeff and Devadoss, Satyan L. and Mugno, John and Sheehy, Don and Ward, Rachel},
  title    = {Shape deformation in continuous map generalization},
  journal  = {GeoInformatica},
  year     = {2009},
  volume   = {13},
  number   = {2},
  pages    = {203--221},
  issn     = {1573-7624},
  abstract = {Given a collection of regions on a map, we seek a method of continuously altering the regions as the scale is varied. This is formalized and brought to rigor as well-defined problems in homotopic deformation. We ask the regions to preserve topology, area-ratios, and relative position as they change over time. A solution is presented using differential methods and computational geometric techniques. Most notably, an application of this method is used to provide an algorithm to obtain cartograms.},
  comment  = {10.1007/s10707-008-0049-0, Jun 1},
  doi      = {10/d24vxs},
  url      = {https://doi.org/10.1007/s10707-008-0049-0},
}

@Book{deBerg2008,
  title     = {Computational Geometry: {Algorithms} and Applications},
  publisher = {Springer-Verlag},
  year      = {2008},
  author    = {de Berg, Mark and Cheong, Otfried and van Kreveld, Marc and Overmars, Mark},
  edition   = {3},
  doi       = {10.1007/978-3-662-03427-9},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Deng2015,
  author    = {Min Deng and Dongliang Peng},
  title     = {Morphing linear features based on their entire structures},
  journal   = {Transactions in GIS},
  year      = {2015},
  volume    = {19},
  number    = {5},
  pages     = {653--677},
  doi       = {10.1111/tgis.12111},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Deng2017,
  author    = {Min Deng and Jianbo Tang and Qiliang Liu and Fang Wu},
  title     = {Recognizing building groups for generalization: a comparative study},
  journal   = {Cartography and Geographic Information Science},
  year      = {2017},
  volume    = {45},
  number    = {3},
  pages     = {187--204},
  doi       = {10.1080/15230406.2017.1302821},
  eprint    = {http://dx.doi.org/10.1080/15230406.2017.1302821},
  owner     = {Dongliang},
  timestamp = {2017.05.17},
  url       = {http://dx.doi.org/10.1080/15230406.2017.1302821},
}

@Article{Deng2012Bend,
  author    = {Deng, Min and Peng, Dongliang and Xu, Zhen and Liu, Huimin},
  title     = {A Morphing method based on bend structures for linear features {(in Chinese)}},
  journal   = {Journal of Central South University (Science and Technology)},
  year      = {2012},
  volume    = {43},
  number    = {7},
  pages     = {2674--2682},
  address   = {Shanghai, China},
  booktitle = {Proc.\ {ISPRS} Workshop on Dynamic and Multi-Dimensional {GIS}},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.zndxzk.com.cn/paper/paper_30098.html},
}

@Article{Deng2011Field,
  author    = {Min Deng and Dongliang Peng and Qiliang Liu and Yan Shi},
  title     = {A Hierarchical Spatial Clustering Algorithm Based on Field Theory {(in Chinese)}},
  journal   = {Geomatics and Information Science of Wuhan University},
  year      = {2011},
  volume    = {36},
  number    = {7},
  pages     = {847--852},
  owner     = {Dongliang},
  timestamp = {2017.04.08},
  url       = {http://ch.whu.edu.cn/CN/Y2011/V36/I7/847},
}

@Article{Dijkstra1959,
  author    = {Edsger. W. Dijkstra},
  title     = {A note on two problems in connexion with graphs},
  journal   = {Numerische Mathematik},
  year      = {1959},
  volume    = {1},
  number    = {1},
  pages     = {269--271},
  comment   = {10.1007/BF01386390},
  doi       = {10/dpvk8c},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
  url       = {http://doi.org/dpvk8c},
}

@Article{Dilo2009tGAP,
  author   = {Dilo, Arta and van Oosterom, Peter and Hofman, Arjen},
  title    = {Constrained {tGAP} for generalization between scales: {The} case of {Dutch} topographic data},
  journal  = {Computers, Environment and Urban Systems},
  year     = {2009},
  volume   = {33},
  number   = {5},
  pages    = {388--402},
  issn     = {0198-9715},
  comment  = {Geo-information Generalisation and Multiple Representation},
  doi      = {10.1016/j.compenvurbsys.2009.07.006},
  keywords = {Automatic map generalization, Object matching, Constrained tGAP},
  url      = {http://www.sciencedirect.com/science/article/pii/S0198971509000532},
}

@Article{Diwan2011Triangulations,
  author        = {Ajit Arvind Diwan and Subir Kumar Ghosh and Partha Pratim Goswami and Andrzej Lingas},
  title         = {On joint triangulations of two sets of points in the plane},
  journal       = {Computing Research Repository ({CoRR})},
  year          = {2011},
  volume        = {abs/1102.1235},
  pages         = {1--9},
  archiveprefix = {arXiv},
  bibsource     = {dblp computer science bibliography, https://dblp.org},
  biburl        = {https://dblp.org/rec/bib/journals/corr/abs-1102-1235},
  eprint        = {1102.1235},
  pagetotal     = {9},
  timestamp     = {Wed, 07 Jun 2017 14:42:59 +0200},
  url           = {http://arxiv.org/abs/1102.1235},
}

@InProceedings{Dokeroglu2014,
  author    = {Dokeroglu, Tanseland Bay{\i}r, Murat Aliand Cosar, Ahmet},
  title     = {Integer linear programming solution for the multiple query optimization problem},
  booktitle = {Proc.\ 29th International Symposium on Computer and Information Sciences, Information Sciences and Systems},
  year      = {2014},
  editor    = {Czach{\'o}rski, Tadeuszand Gelenbe, Eroland Lent, Ricardo},
  pages     = {51--60},
  address   = {Cham},
  publisher = {Springer},
  doi       = {10.1007/978-3-319-09465-6_6},
  isbn      = {978-3-319-09465-6},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1007/978-3-319-09465-6_6},
}

@Article{Douglas1973,
  author    = {Douglas, David H. and Peucker, Thomas K.},
  title     = {Algorithms for the reduction of the number of points required to represent a digitized line or its caricature},
  journal   = {Cartographica},
  year      = {1973},
  volume    = {10},
  number    = {2},
  pages     = {112--122},
  doi       = {10.3138/fm57-6770-u75u-7727},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Doytsher2001,
  author    = {Yerahmiel Doytsher and Sagi Filin and Eti Ezra},
  title     = {Transformation of datasets in a linear-based map conflation framework},
  journal   = {Surveying and Land Information Systems},
  year      = {2001},
  volume    = {61},
  number    = {3},
  pages     = {159--169},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@InCollection{Duchene2014,
  author    = {Duch{\^e}ne, C{\'e}cile and Baella, Blanca and Brewer, Cynthia A. and Burghardt, Dirk and Buttenfield, Barbara P. and Gaffuri, Julien and K{\"a}uferle, Dominik and Lecordix, Fran{\c{c}}ois and Maugeais, Emmanuel and Nijhuis, Ron and Pla, Maria and Post, Marc and Regnauld, Nicolas and Stanislawski, Lawrence V. and Stoter, Jantien and T{\'o}th, Katalin and Urbanke, Sabine and {van Altena}, Vincent and Wiedemann, Antje},
  title     = {Generalisation in Practice Within National Mapping Agencies},
  booktitle = {Abstracting Geographic Information in a Data Rich World: Methodologies and Applications of Map Generalisation},
  publisher = {Springer},
  year      = {2014},
  editor    = {Burghardt, Dirk and Duch{\^e}ne, C{\'e}cile and Mackaness, William},
  series    = {Lecture Notes in Geoinformation and Cartography},
  chapter   = {11},
  pages     = {329--391},
  address   = {Cham},
  isbn      = {978-3-319-00203-3},
  abstract  = {National Mapping Agencies (NMAs) are still among the main end users of research into automated generalisation, which is transferred into their production lines via various means. This chapter includes contributions from seven NMAs, illustrating how automated generalisation is used in practice within their partly or fully automated databases and maps production lines, what results are currently being obtained and what further developments are on-going or planned. A contribution by the European Joint Research Center reports on the use of multiple representation and generalisation in the context of the implementation of the European INSPIRE directive. The chapter finishes with a synthesis of recent achievements, as well as future challenges that NMAs have begun to tackle.},
  doi       = {10.1007/978-3-319-00203-3_11},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
  url       = {https://doi.org/10.1007/978-3-319-00203-3_11},
}

@Article{Dumont2020MultiScale,
  author    = {Marion Dumont and Guillaume Touya and Duch{\^e}ne, C{\'e}cile},
  title     = {Designing multi-scale maps: lessons learned from existing practices},
  journal   = {International Journal of Cartography},
  year      = {2020},
  volume    = {6},
  number    = {1},
  pages     = {121--151},
  doi       = {10.1080/23729333.2020.1717832},
  eprint    = {https://doi.org/10.1080/23729333.2020.1717832},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1080/23729333.2020.1717832},
}

@InProceedings{Efrat2000,
  author    = {Alon Efrat and Sariel Har-peled and Leonidas J. Guibas and T. M. Murali},
  title     = {Morphing between polylines},
  booktitle = {Proc.\ 12th {ACM-SIAM} Symposium on Discrete Algorithms ({SODA})},
  year      = {2001},
  pages     = {680--689},
  address   = {Philadelphia, PA, USA},
  month     = jan,
  publisher = {Society for Industrial and Applied Mathematics},
  comment   = {January 07 - 09},
  isbn      = {0-89871-490-7},
  location  = {Washington, D.C., USA},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://dl.acm.org/citation.cfm?id=365564},
}

@TechReport{Esri1996,
  author      = {ESRI},
  title       = {Automation of Map Generalization: {The} Cutting-Edge Technology},
  institution = {Environmental Systems Research Institute, Inc},
  year        = {1996},
  month       = may,
  owner       = {Dongliang},
  timestamp   = {2017.03.16},
  url         = {http://downloads.esri.com/support/whitepapers/ao_/mapgen.pdf},
}

@Article{Fan2016Matching,
  author    = {Hongchao Fan and Bisheng Yang and Alexander Zipf and Adam Rousell},
  title     = {A polygon-based approach for matching {OpenStreetMap} road networks with regional transit authority data},
  journal   = {International Journal of Geographical Information Science},
  year      = {2016},
  volume    = {30},
  number    = {4},
  pages     = {748--764},
  comment   = {10.1080/13658816.2015.1100732},
  doi       = {10/c5kf},
  eprint    = {http://dx.doi.org/10.1080/13658816.2015.1100732},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Fischetti2012CompactILP,
  author   = {Fischetti, Matteo and Monaci, Michele},
  title    = {Cutting plane versus compact formulations for uncertain (integer) linear programs},
  journal  = {Mathematical Programming Computation},
  year     = {2012},
  volume   = {4},
  number   = {3},
  pages    = {239--273},
  month    = {Sep},
  issn     = {1867-2957},
  abstract = {Robustness is about reducing the feasible set of a given nominal optimization problem by cutting ``risky'' solutions away. To this end, the most popular approach in the literature is to extend the nominal model with a polynomial number of additional variables and constraints, so as to obtain its robust counterpart. Robustness can also be enforced by adding a possibly exponential family of cutting planes, which typically leads to an exponential formulation where cuts have to be generated at run time. Both approaches have pros and cons, and it is not clear which is the best one when approaching a specific problem. In this paper we computationally compare the two options on some prototype problems with different characteristics. We first address robust optimization {\`a} la Bertsimas and Sim for linear programs, and show through computational experiments that a considerable speedup (up to 2 orders of magnitude) can be achieved by exploiting a dynamic cut generation scheme. For integer linear problems, instead, the compact formulation exhibits a typically better performance. We then move to a probabilistic setting and introduce the uncertain set covering problem where each column has a certain probability of disappearing, and each row has to be covered with high probability. A related uncertain graph connectivity problem is also investigated, where edges have a certain probability of failure. For both problems, compact ILP models and cutting plane solution schemes are presented and compared through extensive computational tests. The outcome is that a compact ILP formulation (if available) can be preferable because it allows for a better use of the rich arsenal of preprocessing/cut generation tools available in modern ILP solvers. For the cases where such a compact ILP formulation is not available, as in the uncertain connectivity problem, we propose a restart solution strategy and computationally show its practical effectiveness.},
  day      = {01},
  doi      = {10.1007/s12532-012-0039-y},
  url      = {https://doi.org/10.1007/s12532-012-0039-y},
}

@Article{Fortune1987Voronoi,
  author    = {Steven Fortune},
  title     = {A Sweepline Algorithm for Voronoi Diagrams},
  journal   = {Algorithmica},
  year      = {1987},
  volume    = {2},
  number    = {1},
  pages     = {153--174},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/algorithmica/Fortune87},
  doi       = {10.1007/BF01840357},
  owner     = {Dongliang},
  timestamp = {Wed, 17 May 2017 14:25:14 +0200},
}

@InProceedings{Frank2006,
  author    = {Frank, Richard and Ester, Martin},
  title     = {A Quantitative Similarity Measure for Maps},
  booktitle = {Proc.\ 12th International Symposium on Spatial Data Handling ({SDH})},
  year      = {2006},
  editor    = {Riedl, Andreas and Kainz, Wolfgang and Elmes, Gregory A.},
  pages     = {435--450},
  publisher = {Springer},
  abstract  = {In on-demand map generation, a base-map is modified to meet user requirements on scale, resolution, and other parameters. Since there are many ways of satisfying the requirement, we need a method of measuring the quality of the alternative maps. In this paper, we introduce a uniform framework for measuring the quality of generalized maps. The proposed Map Quality measure takes into account changes in all local objects (Shape Similarity), their neighborhoods (Location Similarity) and lastly across the entire map (Semantic Content Similarity). These three quality aspects measure the major generalization operators of simplification, relocation and selection, exaggeration and aggregation, collapse and typification. The three different aspects are combined using user-specified weights. Thus, the proposed framework supports the automatic choice of best alternative map according to preferences of the user or application.},
  comment   = {Proc.\ 12th International Symposium on Spatial Data Handling ({SDH'06}), Progress in Spatial Data Handling},
  doi       = {10.1007/3-540-35589-8_28},
  isbn      = {978-3-540-35589-2},
  owner     = {Dongliang},
  timestamp = {2017.10.09},
}

@Article{Frolov1975,
  author    = {Yu. S. Frolov},
  title     = {Measuring the shape of geographical phenomena: a history of the issue},
  journal   = {Soviet Geography},
  year      = {1975},
  volume    = {16},
  number    = {10},
  pages     = {676--687},
  doi       = {10.1080/00385417.1975.10640104},
  eprint    = {http://www.tandfonline.com/doi/pdf/10.1080/00385417.1975.10640104},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.tandfonline.com/doi/abs/10.1080/00385417.1975.10640104},
}

@InProceedings{Funke2017Simplification,
  author    = {Stefan Funke and Thomas Mendel and Alexander Miller and Sabine Storandt and Maria Wiebe},
  title     = {Map Simplification with Topology Constraints: Exactly and in Practice},
  booktitle = {Proc.\ 19th Workshop on Algorithm Engineering and Experiments ({ALENEX})},
  year      = {2017},
  pages     = {185--196},
  address   = {Barcelona, Spain},
  biburl    = {https://dblp.org/rec/bib/conf/alenex/FunkeMMSW17},
  comment   = {Hotel Porta Fira, January 17--18},
  doi       = {10/c3s3},
  timestamp = {Fri, 19 May 2017 01:26:03 +0200},
  url       = {https://doi.org/10.1137/1.9781611974768.15},
}

@InProceedings{Fuse2004,
  author    = {T. Fuse and E. Shimizu},
  title     = {Visualizing the landscape of old-time {T}okyo ({E}do city)},
  booktitle = {Proc.\ 20th {ISPRS} Congress},
  year      = {2004},
  editor    = {Gruen, A. and Murai, Sh. and Fuse, T. and Remondino, F.},
  series    = {International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences},
  address   = {Istanbul, Turkey},
  owner     = {Dongliang},
  pagetotal = {8},
  timestamp = {2017.04.28},
  url       = {http://www.isprs.org/proceedings/XXXVI/5-W1/papers/21.pdf},
}

@InProceedings{Gillman1985,
  author    = {Gillman, Daniel W.},
  title     = {Triangulations for rubber-sheeting},
  booktitle = {Digital Representations of Spatial Knowledge},
  year      = {1985},
  pages     = {191--199},
  comment   = {March 11--14},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://cartogis.org/docs/proceedings/archive/auto-carto-7/pdf/triangulations-for-rubber-sheeting.pdf},
}

@InProceedings{Girres2014,
  author    = {Girres, Jean-Fran{\c{c}}ois and Touya, Guillaume},
  title     = {Cartographic generalisation aware of multiple representations},
  booktitle = {Proc.\ 8th International Conference on Geographic Information Science ({GIScience})},
  year      = {2014},
  editor    = {Duckham, Matt and Stewart, Kathleen and Pebesma, Edzer},
  address   = {Vienna, Austria},
  month     = sep,
  note      = {Poster},
  comment   = {September 24-26},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Misc{Gold2003,
  author    = {Christopher Gold and David Thibault},
  title     = {Map Generalization By Skeleton Retraction},
  year      = {2003},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://pdfs.semanticscholar.org/6f7e/f56bb54974ea5269bab442814daab8d5f42a.pdf},
}

@Article{Gomory1958,
  author    = {Gomory, Ralph E.},
  title     = {Outline of an algorithm for integer solutions to linear programs},
  journal   = {Bulletin of the American Mathematical Society},
  year      = {1958},
  volume    = {64},
  number    = {5},
  pages     = {275--278},
  month     = {09},
  comment   = {http://projecteuclid.org/euclid.bams/1183522679},
  doi       = {10.1007/978-3-540-68279-0_4},
  owner     = {Dongliang},
  publisher = {American Mathematical Society},
  timestamp = {2017.04.28},
  url       = {https://link.springer.com/chapter/10.1007/978-3-540-68279-0_4},
}

@Article{GotsmanS2001,
  author    = {Gotsman, Craig and Surazhsky, Vitaly},
  title     = {Guaranteed intersection-free polygon morphing},
  journal   = {Computers \& Graphics},
  year      = {2001},
  volume    = {25},
  number    = {1},
  pages     = {67--75},
  doi       = {10.1016/S0097-8493(00)00108-4},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Greiner1998Clipping,
  author     = {Greiner, G{\"u}nther and Hormann, Kai},
  title      = {Efficient Clipping of Arbitrary Polygons},
  journal    = {ACM Transactions on Graphics},
  year       = {1998},
  volume     = {17},
  number     = {2},
  pages      = {71--83},
  month      = apr,
  issn       = {0730-0301},
  acmid      = {274364},
  address    = {New York, NY, USA},
  comment    = {10.1145/274363.274364},
  doi        = {10/bm9qsg},
  issue_date = {April 1998},
  keywords   = {clipping, polygon comparison},
  numpages   = {13},
  owner      = {Dongliang},
  publisher  = {ACM},
  timestamp  = {2017.10.19},
  url        = {http://doi.acm.org/10.1145/274363.274364},
}

@Article{Guibas2000,
  author    = {Leonidas Guibas and John Hershberger and Subhash Suri},
  title     = {Morphing simple polygons},
  journal   = {Geometry},
  year      = {2000},
  volume    = {24},
  pages     = {1--34},
  doi       = {10.1007/s004540010},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://link.springer.com/article/10.1007/s004540010017},
}

@Article{Gupta1997,
  author    = {Himanshu Gupta and Rephael Wenger},
  title     = {Constructing piecewise linear homeomorphisms of simple polygons},
  journal   = {Journal of Algorithms},
  year      = {1997},
  volume    = {22},
  number    = {1},
  pages     = {142--157},
  doi       = {10.1006/jagm.1995.0808},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@InProceedings{Hampe2004multiple,
  author    = {Hampe, Mark and Sester, Monika and Harrie, Lars},
  title     = {Multiple representation databases to support visualization on mobile devices},
  booktitle = {Proc.\ 20th {ISPRS} Congress},
  year      = {2004},
  volume    = {XXXV (B4: IV)},
  series    = {International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences},
  pages     = {135--140},
  location  = {Istanbul, Turkey},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.3303},
}

@PhdThesis{Harrie2001Phd,
  author    = {Harrie, Lars},
  title     = {An Optimisation Approach to Cartographic Generalisation},
  school    = {Lund University},
  year      = {2001},
  type      = {phdthesis},
  isbn      = {91-628-4652-3},
  issn      = {1403-7726},
  language  = {eng},
  owner     = {Dongliang},
  pagetotal = {204},
  publisher = {Department of Technology and Society, Lund University},
  timestamp = {2017.11.22},
  url       = {http://lup.lub.lu.se/record/41344},
}

@Article{Harrie1999,
  author    = {Lars Harrie},
  title     = {The constraint method for solving spatial conflicts in cartographic generalization},
  journal   = {Cartography and Geographic Information Science},
  year      = {1999},
  volume    = {26},
  number    = {1},
  pages     = {55--69},
  doi       = {10.1559/152304099782424884},
  owner     = {Dongliang},
  publisher = {Taylor \& Francis},
  timestamp = {2017.04.28},
  url       = {https://www.tandfonline.com/doi/abs/10.1559/152304099782424884},
}

@Article{Harrie2002,
  author   = {Harrie, Lars and Sarjakoski, Tapani},
  title    = {Simultaneous graphic generalization of vector data sets},
  journal  = {GeoInformatica},
  year     = {2002},
  volume   = {6},
  number   = {3},
  pages    = {233--261},
  month    = sep,
  issn     = {1573-7624},
  abstract = {Manual cartographic generalization is a simultaneous process. However, most automatic approaches so far have been sequential; generalization operators are applied one at a time in a certain order. This has been the case both for model generalization (generalization of the conceptual model) and graphic generalization. Our research seeks to demonstrate that the graphic part of cartographic generalization can be formulated as an optimization problem and accordingly be solved in a single step. This paper deals with several issues regarding this optimization approach. Firstly, a set of appropriate analytical constraints for the generalization process is given, as well as rules for when to apply these constraints. In our approach, we are limited to formulating these constraints on point locations. Secondly, least-squares adjustment is proposed to find the optimal solution according to the constraints. Finally, the conjugate-gradients method is recommended for solving the normal equations. A prototype system for simultaneous graphic generalization has been implemented in C++, which communicates with a commercial map production system. Results from three tests of the prototype system are included in the paper.},
  day      = {01},
  doi      = {10.1023/A:1019765902987},
  url      = {https://doi.org/10.1023/A:1019765902987},
}

@InCollection{Harrie2007,
  author    = {Lars Harrie and Robert Weibel},
  title     = {Modelling the overall process of map generalization},
  booktitle = {Generalisation of geographic information: Cartographic modelling and applications},
  publisher = {Elsevier},
  year      = {2007},
  editor    = {W. Mackaness and A. Ruas and T. L. Sarjakoski},
  series    = {International Cartographic Association},
  chapter   = {4},
  pages     = {67--88},
  doi       = {10.1016/B978-0-08-045374-3.X5000-5},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.sciencedirect.com/science/book/9780080453743#book-info},
}

@Article{Harrie2015Readability,
  author   = {Harrie, Lars and Stigmar, Hanna and Djordjevic, Milan},
  title    = {Analytical Estimation of Map Readability},
  journal  = {{ISPRS} International Journal of Geo-Information},
  year     = {2015},
  volume   = {4},
  number   = {2},
  pages    = {418--446},
  issn     = {2220-9964},
  abstract = {Readability is a major issue with all maps. In this study, we evaluated whether we can predict map readability using analytical measures, both single measures and composites of measures. A user test was conducted regarding the perceived readability of a number of test map samples. Evaluations were then performed to determine how well single measures and composites of measures could describe the map readability. The evaluation of single measures showed that the amount of information was most important, followed by the spatial distribution of information. The measures of object complexity and graphical resolution were not useful for explaining the map readability of our test data. The evaluations of composites of measures included three methods: threshold evaluation, multiple linear regression and support vector machine. We found that the use of composites of measures was better for describing map readability than single measures, but we could not identify any major differences in the results of the three composite methods. The results of this study can be used to recommend readability measures for triggering and controlling the map generalization process of online maps.},
  comment  = {{ISPRS} International Journal of Geo-Information},
  doi      = {10.3390/ijgi4020418},
  url      = {http://www.mdpi.com/2220-9964/4/2/418},
}

@Article{Harrower2003ColorBrewer,
  author    = {Mark Harrower and Cynthia A. Brewer},
  title     = {ColorBrewer.org: {An} Online Tool for Selecting Colour Schemes for Maps},
  journal   = {The Cartographic Journal},
  year      = {2003},
  volume    = {40},
  number    = {1},
  pages     = {27--37},
  doi       = {10.1179/000870403235002042},
  eprint    = {https://www.tandfonline.com/doi/pdf/10.1179/000870403235002042},
  publisher = {Taylor \& Francis},
  url       = {https://www.tandfonline.com/doi/abs/10.1179/000870403235002042},
}

@Article{Hart1968,
  author    = {Hart, Peter E. and Nilsson, Nils J. and Raphael, Bertram},
  title     = {A formal basis for the heuristic determination of minimum cost paths},
  journal   = {{IEEE} Transactions on Systems, Science, and Cybernetics},
  year      = {1968},
  volume    = {4},
  number    = {2},
  pages     = {100--107},
  doi       = {10.1109/TSSC.1968.300136},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Haunert2011Benchmark,
  author    = {Haunert, Jan-Henrik},
  title     = {Map Generalisation---Quality Benchmarks through Optimisation},
  journal   = {GIM International},
  year      = {2011},
  volume    = {25},
  number    = {1},
  pages     = {31--33},
  abstract  = {Decades of research on map generalisation have resulted in an abundance of heuristic algorithms, evaluation of the performance of which is vital for choosing the most suitable for a certain application. Proper evaluation methods are, however, missing. The author proposes an approach based on optimisation methods adopted from the field of operations research.},
  added-at  = {2011-11-07T12:01:01.000+0100},
  biburl    = {https://www.bibsonomy.org/bibtex/2cab8b8ecb94709dfaa9e9024bf6b2ca9/haunert},
  interhash = {c06be8db4b210efec57d84584686c934},
  intrahash = {cab8b8ecb94709dfaa9e9024bf6b2ca9},
  keywords  = {aggregation map_generalization quality optimization myown integer_programming},
  owner     = {Dongliang},
  timestamp = {2011-11-07T12:01:01.000+0100},
  url       = {https://www.gim-international.com/content/article/map-generalisation},
}

@PhdThesis{haunert2008f,
  author    = {Haunert, Jan-Henrik},
  title     = {Aggregation in map generalization by combinatorial optimization},
  school    = {Leibniz Universit{\"a}t Hannover, Germany},
  year      = {2009},
  type      = {phdthesis},
  isbn      = {978-3-7696-5038-9},
  number    = {626},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://dgk.badw.de/fileadmin/user_upload/Files/DGK/docs/c-626.pdf},
}

@InProceedings{Haunert2005Conflation,
  author    = {Haunert, Jan-Henrik},
  title     = {Link based conflation of geographic datasets},
  booktitle = {Proc.\ 9th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2005},
  address   = {La Coru{\~n}a, Spain},
  month     = jul,
  owner     = {Dongliang},
  pagetotal = {7},
  timestamp = {2017.03.28},
  url       = {http://www1.pub.informatik.uni-wuerzburg.de/pub/haunert/pdf/HaunertMapGen05.pdf},
}

@InProceedings{Haunert2016Partition,
  author    = {Haunert, Jan-Henrik and Meulemans, Wouter},
  title     = {Partitioning polygons via graph augmentation},
  booktitle = {Proc.\ 9th International Conference on Geographic Information Science ({GIScience})},
  year      = {2016},
  editor    = {Miller, A. Jennifer and O'Sullivan, Davidand and Wiegand, Nancy},
  volume    = {9927},
  series    = {Lecture Notes in Computer Science},
  pages     = {18--33},
  address   = {Montreal, QC, Canada},
  publisher = {Springer},
  comment   = {September 27-30
Geographic Information Science: 9th International Conference ({GIScience 2016})},
  doi       = {10.1007/978-3-319-45738-3_2},
  isbn      = {978-3-319-45738-3},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1007/978-3-319-45738-3_2},
}

@Article{Haunert2008Assuring,
  author  = {Haunert, Jan-Henrik and Sester, Monika},
  title   = {Assuring logical consistency and semantic accuracy in map generalization},
  journal = {Photogrammetrie Fernerkundung Geoinformation},
  year    = {2008},
  volume  = {2008},
  number  = {3},
  pages   = {165--173},
  url     = {https://www.dgpf.de/pfg/2008/pfg2008_3_Haunert.pdf},
}

@InProceedings{Haunert2004Skeleton,
  author    = {Haunert, Jan-Henrik and Sester, Monika},
  title     = {Using the straight skeleton for generalisation in a multiple representation environment},
  booktitle = {Proc.\ 7th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2004},
  month     = aug,
  comment   = {August 20--21},
  location  = {Leicester, UK},
  owner     = {Dongliang},
  pagetotal = {10},
  timestamp = {2017.04.28},
  url       = {https://www.ikg.uni-hannover.de/fileadmin/ikg/Forschung/publications/HaunertSester_ICA_workshop2004.pdf},
}

@Article{Haunert2008Skeleton,
  author    = {Haunert, Jan-Henrik and Sester, Monika},
  title     = {Area collapse and road centerlines based on straight skeletons},
  journal   = {GeoInformatica},
  year      = {2008},
  volume    = {12},
  number    = {2},
  pages     = {169--191},
  doi       = {10.1007/s10707-007-0028-x},
  timestamp = {2011-11-07T12:01:04.000+0100},
  url       = {https://link.springer.com/article/10.1007/s10707-007-0028-x},
}

@InCollection{Haunert2016Optimization,
  author    = {Jan-Henrik Haunert and Alexander Wolff},
  title     = {{R{\"a}umliche Analyse durch kombinatorische Optimierung}},
  booktitle = {Handbuch der Geod{\"a}sie (6 B{\"a}nde)},
  publisher = {Springer},
  year      = {2016},
  editor    = {Willi Freeden and Reiner Rummel},
  series    = {Springer Reference Naturwissenschaften},
  pages     = {1--39},
  doi       = {10.1007/978-3-662-46900-2_69-2},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
  url       = {https://doi.org/10.1007/978-3-662-46900-2_69-2},
}

@Article{HaunertWolff2010AreaAgg,
  author    = {Haunert, Jan-Henrik and Wolff, Alexander},
  title     = {Area aggregation in map generalisation by mixed-integer programming},
  journal   = {International Journal of Geographical Information Science},
  year      = {2010},
  volume    = {24},
  number    = {12},
  pages     = {1871--1897},
  month     = nov,
  comment   = {10.1080/13658810903401008
https://www.tandfonline.com/doi/abs/10.1080/13658810903401008},
  doi       = {10/c8v8s2},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://doi.org/c8v8s2},
}

@InProceedings{Haunertwolff2010Building,
  author    = {Haunert, Jan-Henrik and Wolff, Alexander},
  title     = {Optimal and Topologically Safe Simplification of Building Footprints},
  booktitle = {Proc.\ 18th {ACM SIGSPATIAL} International Conference on Advances in Geographic Information Systems ({ACMGIS})},
  year      = {2010},
  editor    = {Abbadi, A. E. and Agrawal, D. and Mokbel, M. and Zhang, P.},
  pages     = {192--201},
  address   = {San Jose, CA, USA},
  month     = nov,
  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.},
  comment   = {November 2--5},
  doi       = {10.1145/1869790.1869819},
  file      = {HaunertWolff2010.pdf:http\://www1.informatik.uni-wuerzburg.de/pub/haunert/pdf/HaunertWolff2010.pdf:PDF},
  interhash = {0394bab4d1dd4ed23bc660c3ea38e215},
  intrahash = {09d394785e27481bff5cd884a42c844e},
  owner     = {Dongliang},
  timestamp = {2017.09.21},
  url       = {http://dl.acm.org/citation.cfm?doid=1869790.1869819},
}

@Article{Haunert2017Label,
  author    = {Haunert, Jan-Henrik and Wolff, Alexander},
  title     = {Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling},
  journal   = {{ISPRS} International Journal of Geo-Information},
  year      = {2017},
  volume    = {6},
  number    = {11},
  issn      = {2220-9964},
  doi       = {10.3390/ijgi6110342},
  pagetotal = {20},
}

@Article{HaunertDilo2009,
  author    = {Haunert, Jan-Henrik and Dilo, Arta and van Oosterom, Peter},
  title     = {Constrained Set-up of the {tGAP} Structure for Progressive Vector Data Transfer},
  journal   = {Computers and Geosciences},
  year      = {2009},
  volume    = {35},
  number    = {11},
  pages     = {2191--2203},
  doi       = {10.1016/j.cageo.2008.11.002},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.sciencedirect.com/science/article/pii/S0098300409000296},
}

@Book{Heath1921,
  title     = {A history of {Greek} mathematics, Volume {II}: {From} aristarchus to diophantus},
  publisher = {Clarendon Press},
  year      = {1921},
  author    = {Heath, T.L.},
  series    = {A History of Greek Mathematics},
  lccn      = {lc22005925},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://archive.org/details/historyofgreekma029268mbp},
}

@InProceedings{Hershberger92speedingup,
  author    = {John Hershberger and Jack Snoeyink},
  title     = {Speeding up the {D}ouglas--{P}eucker line-simplification algorithm},
  booktitle = {Proc.\ 5th International Symposium on Spatial Data Handling ({SDH})},
  year      = {1992},
  pages     = {134--143},
  address   = {Charleston, SC, USA},
  month     = aug,
  comment   = {August 3-7},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.6932},
}

@Article{Huang2017Matrix,
  author    = {Huang, Lina and Ai, Tinghua and van Oosterom, Peter and Yan, Xiongfeng and Yang, Min},
  title     = {A Matrix-Based Structure for Vario-Scale Vector Representation over a Wide Range of Map Scales: The Case of River Network Data},
  journal   = {{ISPRS} International Journal of Geo-Information},
  year      = {2017},
  volume    = {6},
  number    = {7},
  issn      = {2220-9964},
  abstract  = {The representation of vector data at variable scales has been widely applied in geographic information systems and map-based services. When the scale changes across a wide range, a complex generalization that involves multiple operations is required to transform the data. To present such complex generalization, we proposed a matrix model to combine different generalization operations into an integration. This study was carried on a set of river network data, where two operations, i.e., network pruning accompanied with river simplification, were hierarchically constructed as the rows and columns of a matrix. The correspondence between generalization operations and scale, and the scale linkage of multiple operations were also explicitly defined. In addition, we developed a vario-scale data structure to store the generalized river network data based on the proposed matrix. The matrix model was validated and assessed by a comparison with traditional methods that conduct generalization operations in sequence. It was shown that the matrix model enabled complex generalization with good generalization quality. Taking advantage of the corresponding vario-scale data structure, the river network data could be obtained at any arbitrary scale, and the vario-scale representation was achieved across a wide scale range.},
  comment   = {http://www.mdpi.com/2220-9964/6/7/218},
  doi       = {10.3390/ijgi6070218},
  owner     = {Dongliang},
  pagetotal = {20},
  timestamp = {2017.11.22},
}

@Article{Huang2016Webmap,
  author   = {Lina Huang and Martijn Meijers and Radan \v{S}uba and Peter van Oosterom},
  journal  = {{ISPRS} Journal of Photogrammetry and Remote Sensing},
  title    = {Engineering web maps with gradual content zoom based on streaming vector data},
  year     = {2016},
  issn     = {0924-2716},
  pages    = {274--293},
  volume   = {114},
  doi      = {10.1016/j.isprsjprs.2015.11.011},
  keywords = {Internet/Web, GIS, Simplification, Spatial Infrastructures, Vector, Mobile},
  url      = {http://www.sciencedirect.com/science/article/pii/S0924271615002646},
}

@Article{Iben2009,
  author    = {Hayley N. Iben and James F. O'Brien and Erik D. Demaine},
  title     = {Refolding planar polygons},
  journal   = {Discrete and Computational Geometry},
  year      = {2009},
  volume    = {41},
  number    = {3},
  pages     = {444--460},
  doi       = {10.1007/s00454-009-9145-7},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://graphics.cs.berkeley.edu/papers/Iben-RPP-2009-04/},
}

@InCollection{ImaiIri1988,
  author    = {Hiroshi Imai and Masao Iri},
  title     = {Polygonal Approximations of a Curve---Formulations and Algorithms},
  booktitle = {Machine Intelligence and Pattern Recognition},
  publisher = {Elsevier},
  year      = {1988},
  editor    = {Godfried T. Toussaint},
  volume    = {6},
  series    = {Computational Morphology: A Computational Geometric Approach to the Analysis of Form},
  pages     = {71--86},
  doi       = {10.1016/B978-0-444-70467-2.50011-4},
  owner     = {Dongliang},
  timestamp = {2017.08.03},
  url       = {https://www.sciencedirect.com/science/article/pii/B9780444704672500114},
}

@Article{Jarnik1930,
  author    = {Jarn{\'i}k, V.},
  title     = {O jist{\'e}m probl{\'e}mu minim{\'a}ln{\'i}m [{A}bout a certain minimal problem]},
  journal   = {Pr{\'a}ce Moravsk{\'e} p{\v{r}}{\'i}rodov{\v{e}}deck{\'e} spole{\v{c}}nosti},
  year      = {1930},
  volume    = {6},
  number    = {4},
  pages     = {57--63},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
}

@Article{Jiang2015Fractal,
  author    = {Bin Jiang},
  title     = {The fractal nature of maps and mapping},
  journal   = {International Journal of Geographical Information Science},
  year      = {2015},
  volume    = {29},
  number    = {1},
  pages     = {159--174},
  doi       = {10.1080/13658816.2014.953165},
  eprint    = {http://dx.doi.org/10.1080/13658816.2014.953165},
  owner     = {Dongliang},
  timestamp = {2017.08.29},
  url       = {http://dx.doi.org/10.1080/13658816.2014.953165},
}

@Misc{Johnson2014,
  author    = {Angus Johnson},
  title     = {Clipper---an open source freeware library for clipping and offsetting lines and polygons},
  month     = jan,
  year      = {2014},
  note      = {Accessed: 2017-08-22},
  owner     = {Dongliang},
  timestamp = {2017.08.22},
  url       = {http://www.angusj.com/delphi/clipper.php},
}

@InProceedings{Kannan1978IP,
  author    = {Kannan, Ravindran and Monma, Clyde L.},
  title     = {On the Computational Complexity of Integer Programming Problems},
  booktitle = {Optimization and Operations Research},
  year      = {1978},
  editor    = {Henn, Rudolf and Korte, Bernhard and Oettli, Werner},
  pages     = {161--172},
  address   = {Berlin, Heidelberg},
  publisher = {Springer},
  abstract  = {Recently much effort has been devoted to determining the computational complexity for a variety of integer programming problems. In this paper a general integer programming problem is shown to be NP-complete; the proof given for this result uses only elementary linear algebra. Complexity results are also summarized for several particularizations of this general problem, including knapsack problems, problems which relax integrality or non-negativity restrictions and integral optimization problems with a fixed number of variables.},
  doi       = {10.1007/978-3-642-95322-4_17},
  isbn      = {978-3-642-95322-4},
  url       = {https://link.springer.com/chapter/10.1007/978-3-642-95322-4_17},
}

@Article{Karmarkar1984LP,
  author   = {Karmarkar, N.},
  title    = {A new polynomial-time algorithm for linear programming},
  journal  = {Combinatorica},
  year     = {1984},
  volume   = {4},
  number   = {4},
  pages    = {373--395},
  month    = dec,
  issn     = {1439-6912},
  abstract = {We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n3.5 L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input. The running-time of this algorithm is better than the ellipsoid algorithm by a factor ofO(n                2.5). We prove that given a polytopeP and a strictly interior point a $\epsilon$P, there is a projective transformation of the space that mapsP, a toP{\textasciiacutex}, a{\textasciiacutex} having the following property. The ratio of the radius of the smallest sphere with center a{\textasciiacutex}, containingP{\textasciiacutex} to the radius of the largest sphere with center a{\textasciiacutex} contained inP{\textasciiacutex} isO(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial time.},
  comment  = {10.1007/BF02579150
https://doi.org/10.1007/BF02579150},
  day      = {01},
  doi      = {10/czqmxn},
  url      = {http://doi.org/czqmxn},
}

@Article{Keane1975Size,
  author   = {M Keane},
  journal  = {Environment and Planning A: Economy and Space},
  title    = {The Size of the Region-Building Problem},
  year     = {1975},
  number   = {5},
  pages    = {575--577},
  volume   = {7},
  abstract = {The problem of region building can be viewed as an aggregation problem. This note presents some combinatorial mathematics which outline the size of the problem. The methods are particularly useful in situations where the number of spatial units to be regionalized is large.},
  doi      = {10.1068/a070575},
  eprint   = {https://doi.org/10.1068/a070575},
  url      = {https://journals.sagepub.com/doi/10.1068/a070575
        https://doi.org/10.1068/a070575},
}

@Book{Koch1988,
  title     = {Parameter Estimation and Hypothesis Testing in Linear Models},
  publisher = {Springer-Verlag New York, Inc.},
  year      = {1988},
  author    = {Koch, Karl-Rudolf},
  address   = {New York, NY, USA},
  isbn      = {0-387-18840-1},
  doi       = {10.1007/978-3-662-03976-2},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
  url       = {https://www.springer.com/gp/book/9783540652571},
}

@Book{Kokholm2006,
  title     = {The C5 Generic Collection Library for C\# and CLI},
  publisher = {IT University of Copenhagen},
  year      = {2006},
  author    = {Niels Kokholm and Peter Sestoft},
  owner     = {Dongliang},
  timestamp = {2017.10.11},
  url       = {https://www.itu.dk/research/c5/},
}

@Book{Kraus2004,
  title     = {Photogrammetry -- Geometry From Images and Laser Scans},
  publisher = {de Gruyter},
  year      = {2004},
  author    = {Karl Kraus},
  address   = {Berlin, Germany},
  edition   = {2},
  journal   = {Photogrammetry},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Kruskal1956,
  author    = {Joseph B. Kruskal},
  title     = {On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem},
  journal   = {Proceedings of the American Mathematical Society},
  year      = {1956},
  volume    = {7},
  number    = {1},
  pages     = {48--50},
  issn      = {00029939, 10886826},
  doi       = {10.2307/2033241},
  owner     = {Dongliang},
  publisher = {American Mathematical Society},
  timestamp = {2017.11.22},
  url       = {http://www.jstor.org/stable/2033241},
}

@Article{Latecki2000,
  author    = {L. J. Latecki and R. Lakamper},
  title     = {Shape similarity measure based on correspondence of visual parts},
  journal   = {{IEEE} Transactions on Pattern Analysis and Machine Intelligence},
  year      = {2000},
  volume    = {22},
  number    = {10},
  pages     = {1185--1190},
  issn      = {0162-8828},
  comment   = {Oct},
  doi       = {10.1109/34.879802},
  keywords  = {image matching;image retrieval;visual databases;2D objects;cognitively motivated similarity measure;digital curve evolution;digitization noise influence reduction;image databases;object retrieval;segmentation errors;shape matching;shape similarity measure;silhouette databases;visual parts correspondence;Shape measurement},
  owner     = {Dongliang},
  timestamp = {2017.10.17},
}

@InProceedings{Latecki2003,
  author    = {Latecki, Longin Jan and Lak{\"a}mper, Rolf and Wolter, Diedrich},
  title     = {Shape Similarity and Visual Parts},
  booktitle = {Proc.\ 11th International Conference on Discrete Geometry for Computer Imagery ({DGCI}),},
  year      = {2003},
  editor    = {Nystr{\"o}m, Ingela and Sanniti di Baja, Gabriella and Svensson, Stina},
  volume    = {2886},
  series    = {Lecture Notes in Computer Science},
  pages     = {34--51},
  address   = {Naples, Italy},
  month     = nov,
  publisher = {Springer},
  abstract  = {Human perception of shape is based on visual parts of objects to a point that a single, significant visual part is sufficient to recognize the whole object. For example, if you see a hand in the door, you expect a human behind the door. Therefore, a cognitively motivated shape similarity measure for recognition applications should be based on visual parts. This cognitive assumption leads to two related problems of scale selection and subpart selection. To find a given query part Q as part of an object C, Q needs to have a correct size with regards to C (scale selection). Assuming that the correct size is selected, the part Q must be compared to all possible subparts of C (subpart selection). For global, contour-based similarity measures, scaling the whole contour curves of both objects to the same length usually solves the problem of scale selection. Although this is not an optimal solution, it works if the whole contour curves are `sufficiently' similar. Subpart selection problem does not occur in the implementation of global similarity measures.},
  comment   = {November 19--21
Springer Berlin Heidelberg},
  doi       = {10.1007/978-3-540-39966-7_3},
  isbn      = {978-3-540-39966-7},
  owner     = {Dongliang},
  timestamp = {2017.10.09},
  url       = {https://doi.org/10.1007/978-3-540-39966-7_3},
}

@InProceedings{Leach1992Delaunay,
  author    = {Geoff Leach},
  title     = {Improving Worst-Case Optimal Delaunay Triangulation Algorithms},
  booktitle = {Proc.\ 4th {Canadian} Conference on Computational Geometry ({CCCG})},
  year      = {1992},
  owner     = {Dongliang},
  pagetotal = {15},
  timestamp = {2017.10.20},
  url       = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.2323},
}

@InProceedings{Lee2005,
  author    = {Dan Lee and Paul Hardy},
  title     = {Automating Generalization -- Tools and Models},
  booktitle = {Proc.\ 22nd International Cartographic Conference ({ICC})},
  year      = {2005},
  address   = {A Coru{\~n}a, Spain},
  comment   = {July 11--16},
  owner     = {Dongliang},
  pagetotal = {10},
  timestamp = {2017.04.28},
  url       = {http://www.pghardy.net/paul/papers/2005_icc_coruna_lee_hardy.pdf},
}

@Article{Lee1980Tree,
  author     = {Lee, D. T. and Wong, C. K.},
  title      = {Quintary Trees: A File Structure for Multidimensional Datbase Sytems},
  journal    = {ACM Transactions on Database Systems},
  year       = {1980},
  volume     = {5},
  number     = {3},
  pages      = {339--353},
  issn       = {0362-5915},
  acmid      = {320618},
  address    = {New York, NY, USA},
  comment    = {#sep#},
  doi        = {10.1145/320613.320618},
  issue_date = {Sept. 1980},
  keywords   = {database system, exact match queries, file maintenance, information retrieval, key, multidimensional space, queries, range search, search},
  owner      = {Dongliang},
  pagetotal  = {15},
  publisher  = {ACM},
  timestamp  = {2017.10.20},
  url        = {http://doi.acm.org/10.1145/320613.320618},
}

@Article{Li2007,
  author    = {Zhilin Li},
  title     = {Digital Map Generalization at the Age of Enlightenment: a Review of the First Forty Years},
  journal   = {The Cartographic Journal},
  year      = {2007},
  volume    = {44},
  number    = {1},
  pages     = {80--93},
  doi       = {10.1179/000870407X173913},
  eprint    = {http://dx.doi.org/10.1179/000870407X173913},
  owner     = {Dongliang},
  timestamp = {2017.07.11},
  url       = {http://dx.doi.org/10.1179/000870407X173913},
}

@InProceedings{Li2008,
  author    = {Li, Zhilin and Wong, Meiling},
  title     = {Animating basic operations for digital map generalization with morphing techniques},
  booktitle = {Proc.\ The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Science},
  year      = {2008},
  volume    = {XXXVII},
  number    = {Part B2},
  pages     = {637--642},
  address   = {Beijing, China},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.isprs.org/proceedings/XXXVII/congress/2_pdf/5_WG-II-5/05.pdf},
}

@Article{Li2012Continuous,
  author    = {Zhilin Li and Qi Zhou},
  title     = {Integration of linear and areal hierarchies for continuous multi-scale representation of road networks},
  journal   = {International Journal of Geographical Information Science},
  year      = {2012},
  volume    = {26},
  number    = {5},
  pages     = {855--880},
  doi       = {10.1080/13658816.2011.616861},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1080/13658816.2011.616861},
}

@Article{Li2017Annealing,
  author    = {Li, Jingzhong and Ai, Tinghua and Liu, Pengcheng and Yang, Min},
  title     = {Continuous Scale Transformations of Linear Features Using Simulated Annealing-Based Morphing},
  journal   = {{ISPRS} International Journal of Geo-Information},
  year      = {2017},
  volume    = {6},
  number    = {8},
  issn      = {2220-9964},
  abstract  = {This paper presents a new method for use in performing continuous scale transformations of linear features using Simulated Annealing-Based Morphing (SABM). This study addresses two key problems in the continuous generalization of linear features by morphing, specifically the detection of characteristic points and correspondence matching. First, an algorithm that performs robust detection of characteristic points is developed that is based on the Constrained Delaunay Triangulation (CDT) model. Then, an optimal problem is defined and solved to associate the characteristic points between a coarser representation and a finer representation. The algorithm decomposes the input shapes into several pairs of corresponding segments and uses the simulated annealing algorithm to find the optimal matching. Simple straight-line trajectories are used to define the movements between corresponding points. The experimental results show that the SABM method can be used for continuous generalization and generates smooth, natural and visually pleasing linear features with gradient effects. In contrast to linear interpolation, the SABM method uses the simulated annealing technique to optimize the correspondence between characteristic points. Moreover, it avoids interior distortions within intermediate shapes and preserves the geographical characteristics of the input shapes.},
  doi       = {10.3390/ijgi6080242},
  owner     = {Dongliang},
  pagetotal = {15},
  timestamp = {2017.09.21},
  url       = {http://www.mdpi.com/2220-9964/6/8/242},
}

@Article{Li2017_Building,
  author    = {Li, Jingzhong and Li, Xingong and Xie, Tian},
  title     = {Morphing of Building Footprints Using a Turning Angle Function},
  journal   = {{ISPRS} International Journal of Geo-Information},
  year      = {2017},
  volume    = {6},
  number    = {6},
  issn      = {2220-9964},
  abstract  = {We study the problem of morphing two polygons of building footprints at two different scales. This problem frequently occurs during the continuous zooming of interactive maps. The ground plan of a building footprint on a map has orthogonal characteristics, but traditional morphing methods cannot preserve these geographic characteristics at intermediate scales. We attempt to address this issue by presenting a turning angle function-based morphing model (TAFBM) that can generate polygons at an intermediate scale with an identical turning angle for each side. Thus, the orthogonal characteristics can be preserved during the entire interpolation. A case study demonstrates that the model yields good results when applied to data from a building map at various scales. During the continuous generalization, the orthogonal characteristics and their relationships with the spatial direction and topology are well preserved.},
  doi       = {10.3390/ijgi6060173},
  owner     = {Dongliang},
  pagetotal = {13},
  timestamp = {2017.09.21},
  url       = {http://www.mdpi.com/2220-9964/6/6/173},
}

@Article{Li2013Compactness,
  author    = {Wenwen Li and Michael F. Goodchild and Richard Church},
  title     = {An efficient measure of compactness for two-dimensional shapes and its application in regionalization problems},
  journal   = {International Journal of Geographical Information Science},
  year      = {2013},
  volume    = {27},
  number    = {6},
  pages     = {1227--1250},
  comment   = {10.1080/13658816.2012.752093},
  doi       = {10/c5kg},
  eprint    = {https://doi.org/10.1080/13658816.2012.752093},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1080/13658816.2012.752093},
}

@Article{Li2004,
  author    = {Z. Li and H. Yan and T. Ai and J. Chen},
  title     = {Automated building generalization based on urban morphology and Gestalt theory},
  journal   = {International Journal of Geographical Information Science},
  year      = {2004},
  volume    = {18},
  number    = {5},
  pages     = {513--534},
  doi       = {10.1080/13658810410001702021},
  eprint    = {http://www.tandfonline.com/doi/pdf/10.1080/13658810410001702021},
  owner     = {Dongliang},
  timestamp = {2017.08.24},
  url       = {http://www.tandfonline.com/doi/abs/10.1080/13658810410001702021},
}

@Article{Liu2011Multi,
  author    = {Qiliang Liu and Min Deng and Yan Shi and Dongliang Peng},
  title     = {A Novel Spatial Clustering Method Based on Multi-Constraints {(in Chinese)}},
  journal   = {Acta Geodaetica et Cartographica Sinica},
  year      = {2011},
  volume    = {40},
  number    = {4},
  pages     = {509--516},
  doi       = {http://xb.sinomaps.com/CN/Y2011/V40/I4/0},
  owner     = {Dongliang},
  timestamp = {2017.04.08},
}

@Article{Liu2011Validity,
  author    = {Qiliang Liu and Min Deng and Dongliang Peng and Jiaqiu Wang},
  title     = {Validity Assessment of Spatial Clustering Methods Based on Gravitational Theory {(in Chinese)}},
  journal   = {Geomatics and Information Science of Wuhan University},
  year      = {2011},
  volume    = {36},
  number    = {8},
  pages     = {847--852},
  owner     = {Dongliang},
  timestamp = {2017.04.08},
  url       = {http://ch.whu.edu.cn/CN/Y2011/V36/I8/982},
}

@InProceedings{Lubiw2017CT,
  author    = {Anna Lubiw and Debajyoti Mondal},
  title     = {On Compatible Triangulations with a Minimum Number of Steiner Points},
  booktitle = {Proc.\ 29th {Canadian} Conference on Computational Geometry ({CCCG})},
  year      = {2017},
  pages     = {101--106},
  address   = {Ottawa, Ontario, Canada},
  comment   = {July 26--28},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
  url       = {http://arxiv.org/abs/1706.09086},
}

@InProceedings{Lueker1978,
  author    = {G. S. Lueker},
  title     = {A data structure for orthogonal range queries},
  booktitle = {Proc.\ 19th Annual Symposium on Foundations of Computer Science ({SFCS})},
  year      = {1978},
  pages     = {28--34},
  comment   = {Oct},
  doi       = {10.1109/SFCS.1978.1},
  issn      = {0272-5428},
  keywords  = {Binary search trees;Computer science;Data structures;Decision trees;Multidimensional systems;Tree data structures},
  owner     = {Dongliang},
  timestamp = {2017.10.20},
}

@Article{Maceachren1985,
  author    = {Alan M. Maceachren},
  title     = {Compactness of Geographic Shape: {Comparison} and Evaluation of Measures},
  journal   = {Geografiska Annaler: Series B, Human Geography},
  year      = {1985},
  volume    = {67},
  number    = {1},
  pages     = {53--67},
  issn      = {04353684, 14680467},
  abstract  = {Geographic shape compactness is of concern in such contexts as urban morphology, political districting, and accuracy of enumeration unit values. The purpose of the present paper is to compare, categorize, and evaluate the various methods suggested for measuring compactness. Review of suggested compactness indices resulted in the identification of four categories, based upon: 1) perimeter-area measurement, 2) single parameters of related circles, 3) direct comparison to a standard shape, and 4) dispersion of elements of a shape's area. In all, eleven indices were calculated for a sample of U.S. counties and their frequency distributions were compared. Additionally, similarities and differences in the units of high, median, and low compactness were identified. Within each category, indices exhibited considerable similarity while significant differences were evident from category to category. These differences suggested variation in accuracy with which the indices measure compactness. It was hypothesized that measures based upon dispersion of elements of a shape's area would provide the most accurate measure because they consider the shape as a whole while the other indices do not. Determination of the accuracy with which each index measures compactness supported this hypothesis. Indices based upon direct comparison to a standard shape were found to be of similar accuracy and, therefore, also judged to be suitable compactness measures. Those measures based upon perimeter-area measurement and single parameters of related circles were determined to be considerably less accurate measures of compactness.},
  comment   = {10.1080/04353684.1985.11879515},
  doi       = {10/c329},
  owner     = {Dongliang},
  publisher = {Routledge},
  timestamp = {2017.10.06},
}

@InCollection{Mackaness2017Generalization,
  author    = {Mackaness, William A. and Burghardt, Dirk and Duch{\^e}ne, C{\'e}cile},
  title     = {Map Generalization},
  booktitle = {International Encyclopedia of Geography: People, the Earth, Environment and Technology},
  publisher = {John Wiley \& Sons},
  year      = {2016},
  pages     = {1--16},
  isbn      = {9781118786352},
  comment   = {10.1002/9781118786352.wbieg1015
http://dx.doi.org/10.1002/9781118786352.wbieg1015},
  doi       = {10/cx89},
  keywords  = {cartography, computational methods, geovisualization, GIS, map generalization, national mapping agencies, scale, spatial analysis, spatial modeling},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
  url       = {http://doi.org/cx89},
}

@Article{Masuyama2006Tessellation,
  author    = {Atsushi Masuyama},
  title     = {Methods for detecting apparent differences between spatial tessellations at different time points},
  journal   = {International Journal of Geographical Information Science},
  year      = {2006},
  volume    = {20},
  number    = {6},
  pages     = {633--648},
  comment   = {10.1080/13658810600661300
http://dx.doi.org/10.1080/13658810600661300},
  doi       = {10/c9k3jg},
  eprint    = {http://dx.doi.org/10.1080/13658810600661300},
  owner     = {Dongliang},
  publisher = {Taylor \& Francis},
  timestamp = {2017.10.16},
  url       = {http://doi.org/c9k3jg},
}

@InProceedings{Matuk2006,
  author    = {Matuk, Krzysztof and Gold, Christopher and Li, Zhilin},
  title     = {Skeleton Based Contour Line Generalization},
  booktitle = {Proc.\ 12th International Symposium on Spatial Data Handling ({SDH})},
  year      = {2006},
  editor    = {Riedl, Andreas and Kainz, Wolfgang and Elmes, Gregory A.},
  pages     = {643--658},
  address   = {Berlin, Heidelberg},
  publisher = {Springer},
  comment   = {Progress in Spatial Data Handling: 12th International Symposium on Spatial Data Handling ({SDH'06})},
  doi       = {10.1007/3-540-35589-8_41},
  isbn      = {978-3-540-35589-2},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1007/3-540-35589-8_41},
}

@InProceedings{Maus2010AllCN,
  author    = {Arne Maus and Jon Moen Drange},
  title     = {All closest neighbors are proper Delaunay edges generalized, and its application to parallel algorithms},
  booktitle = {Norsk Informatikkonferanse},
  year      = {2010},
  editor    = {Terje Fallmyr and Erik Hjelm{\aa}s},
  pages     = {1--12},
  publisher = {Tapir Akademisk Forlag},
  comment   = {https://www.semanticscholar.org/paper/All-closest-neighbors-are-proper-Delaunay-edges-%2C-Maus-Drange/32fb5cb1b83ab274c181b0932b26c0dc591f25ec?tab=abstract},
  owner     = {Dongliang},
  timestamp = {2017.10.20},
  url       = {http://heim.ifi.uio.no/~arnem/Nik2010/PaperLatex.pdf},
}

@InProceedings{Meijers2016,
  author    = {Martijn Meijers},
  title     = {Building simplification using offset curves obtained from the straight skeleton},
  booktitle = {Proc.\ 19th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2016},
  address   = {Helsinki, Finland},
  comment   = {August 23--24},
  owner     = {Dongliang},
  pagetotal = {8},
  timestamp = {2017.04.28},
  url       = {https://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2016/genemr2016_paper_11.pdf},
}

@PhdThesis{Meijers2011Thesis,
  author = {Martijn Meijers},
  title  = {Variable-scale Geo-information},
  school = {Delft University of Technology},
  year   = {2011},
  type   = {phdthesis},
  month  = dec,
  isbn   = {978-9-6132-335-8},
  url    = {http://www.gdmc.nl/publications/2011/Variable-scale_Geo-information.pdf},
}

@InCollection{Meijers2011LineSimp,
  author    = {Meijers, Martijn},
  title     = {Simultaneous {\&} topologically-safe line simplification for a variable-scale planar partition},
  booktitle = {Advancing Geoinformation Science for a Changing World},
  publisher = {Springer Berlin Heidelberg},
  year      = {2011},
  editor    = {Geertman, Stan and Reinhardt, Wolfgang and Toppen, Fred},
  pages     = {337--358},
  address   = {Berlin, Heidelberg},
  isbn      = {978-3-642-19789-5},
  abstract  = {We employ a batch generalization process for obtaining a variable- scale planar partition. We describe an algorithm to simplify the boundary lines after a map generalization operation (either a merge or a split operation) has been applied on a polygonal area and its neighbours. The simplification is performed simultaneously on the resulting boundaries of the new polygonal areas that replace the areas that were processed. As the simplification strategy has to keep the planar partition valid, we define what we consider to be a valid planar partition (among other requirements, no zero-sized areas and no unwanted intersections in the boundary polylines). Furthermore, we analyse the effects of the line simplification for the content of the data structures in which the planar partition is stored.},
  doi       = {10.1007/978-3-642-19789-5_17},
  url       = {https://doi.org/10.1007/978-3-642-19789-5_17},
}

@Article{Meijers2016Split,
  author    = {Meijers, Martijn and Savino, Sandro and van Oosterom, Peter},
  journal   = {International Journal of Geographical Information Science},
  title     = {\textsc{SplitArea}: {An} algorithm for weighted splitting of faces in the context of a planar partition},
  year      = {2016},
  number    = {8},
  pages     = {1522--1551},
  volume    = {30},
  doi       = {10.1080/13658816.2016.1140770},
  eprint    = {https://doi.org/10.1080/13658816.2016.1140770},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1080/13658816.2016.1140770},
}

@InProceedings{Meijers2015Parallel,
  author    = {Meijers, Martijn and \v{S}uba, Radan and van Oosterom, Peter},
  title     = {Parallel Creation of Vario-scale Data Structures for Large Datasets},
  booktitle = {Proc.\ 4th ISPRS International Workshop on Web Mapping and Geoprocessing Services},
  year      = {2015},
  editor    = {B. Veenendaal and M. Brovelli and L. Wu},
  volume    = {XL-4/W7},
  series    = {The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences},
  pages     = {1--9},
  address   = {Sardinia, Italy},
  month     = jul,
  comment   = {01--03 July 2015},
  doi       = {10.5194/isprsarchives-XL-4-W7-1-2015},
  url       = {https://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XL-4-W7/1/2015/},
}

@Article{Meijers2020Web,
  author    = {Meijers, Martijn and van Oosterom, Peter and Driel, Mattijs and \v{S}uba, Radan},
  title     = {Web-based dissemination of continuously generalized space-scale cube data for smooth user interaction},
  journal   = {International Journal of Cartography},
  year      = {2020},
  volume    = {6},
  number    = {1},
  pages     = {152--176},
  doi       = {10.1080/23729333.2019.1705144},
  eprint    = {https://doi.org/10.1080/23729333.2019.1705144},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1080/23729333.2019.1705144},
}

@Article{Meijers2018Framework,
  author  = {Meijers, M. and van Oosterom, P. and \v{S}uba, R. and Peng, D.},
  journal = {{ISPRS} - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences},
  title   = {TOWARDS A SCALE DEPENDENT FRAMEWORK FOR CREATING VARIO-SCALE MAPS},
  year    = {2018},
  pages   = {425--432},
  volume  = {XLII-4},
  doi     = {10.5194/isprs-archives-XLII-4-425-2018},
  url     = {https://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XLII-4/425/2018/},
}

@Article{Midtbo2007,
  author    = {Terje Midtb{\o} and Trond Nordvik},
  title     = {Effects of Animations in Zooming and Panning Operations on Web maps: A Web-based Experiment},
  journal   = {The Cartographic Journal},
  year      = {2007},
  volume    = {44},
  number    = {4},
  pages     = {292--303},
  comment   = {10.1179/000870407X241845
10/dgnjmj
https://doi.org/10.1179/000870407X241845},
  doi       = {10/dgnjmj},
  eprint    = {https://doi.org/10.1179/000870407X241845},
  publisher = {Taylor \& Francis},
  url       = {http://doi.org/dgnjmj},
}

@Article{Minas2016,
  author    = {Minas, James P. and Hearne, John W.},
  title     = {An optimization model for aggregation of prescribed burn units},
  journal   = {TOP},
  year      = {2016},
  volume    = {24},
  number    = {1},
  pages     = {180--195},
  issn      = {1863-8279},
  abstract  = {Fire is a natural component of many terrestrial ecosystems; however, uncontrolled intense wildfires can cause loss of human life and destruction of natural resources. Prescribed burning is a management activity undertaken for the purposes of both wildfire hazard reduction and the preservation of fire-adapted ecosystems. Achievement of prescribed burn targets is made difficult by operational constraints such as limited personnel, equipment and suitable weather for undertaking burning. Prescribed burn program implementation may benefit from efficiencies gained in undertaking larger burns. Here, we present a mixed-integer programming formulation for aggregation of prescribed burn units. The model minimizes the total prescribed burn perimeter requiring management, by aggregating existing `fundamental' burn units into larger compact and contiguous units or `clusters'. This problem is a special case of the `supervised regionalization' or the ` {\$}{\$}p{\$}{\$} p -regions problem'. The model's functionality is demonstrated on a test landscape and a number of extensions and implementation issues are discussed.},
  comment   = {Apr},
  day       = {01},
  doi       = {10.1007/s11750-015-0383-y},
  owner     = {Dongliang},
  timestamp = {2017.10.05},
  url       = {https://doi.org/10.1007/s11750-015-0383-y},
}

@InCollection{Muller1991,
  author    = {Muller, J-C},
  title     = {Generalization of spatial databases},
  booktitle = {Geographical Information Systems: {Principles} and Applications},
  publisher = {Longman Scientific \& Technical},
  year      = {1991},
  editor    = {Maguire, David J. and Goodchild, Michael F. and Rhind, David W.},
  pages     = {457--475},
  owner     = {Dongliang},
  timestamp = {2017.10.09},
}

@Article{Muller1978Intersection,
  author    = {D.E. Muller and F.P. Preparata},
  title     = {Finding the intersection of two convex polyhedra},
  journal   = {Theoretical Computer Science},
  year      = {1978},
  volume    = {7},
  number    = {2},
  pages     = {217 -- 236},
  issn      = {0304-3975},
  doi       = {10.1016/0304-3975(78)90051-8},
  owner     = {Dongliang},
  timestamp = {2017.10.21},
  url       = {http://www.sciencedirect.com/science/article/pii/0304397578900518},
}

@InCollection{Muller1995Generalization,
  author    = {M{\"u}ller, Jean-Claude and Weibel, Robert and Lagrange, Jean-Philippe and Salg{\'e}, F.},
  title     = {Generalization: {State} of the art and issues},
  booktitle = {{GIS} and Generalization: Methodology and Practice},
  publisher = {Taylor \& Francis},
  year      = {1995},
  editor    = {M{\"u}ller, Jean-Claude and Lagrange, Jean-Philippe and Weibel, Robert},
  number    = {1},
  series    = {GISDATA},
  chapter   = {1},
  pages     = {3--17},
  address   = {London, UK},
  comment   = {http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.4904&rank=1&q=Generalization:%20state%20of%20the%20art%20and%20issues&osm=&ossid=},
}

@Article{Mustiere2008,
  author    = {Musti{\`e}re, S{\'e}bastien and Devogele, Thomas},
  title     = {Matching networks with different levels of detail},
  journal   = {GeoInformatica},
  year      = {2008},
  volume    = {12},
  number    = {4},
  pages     = {435--453},
  issn      = {1384-6175},
  doi       = {10.1007/s10707-007-0040-1},
  language  = {English},
  owner     = {Dongliang},
  publisher = {Springer US},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1007/s10707-007-0040-1},
}

@InProceedings{Nations1989,
  author    = {United Nations},
  title     = {Modern mapping techniques},
  booktitle = {United Nations Inter-Regional Seminar},
  pages     = {Honefoss, Norway},
  owner     = {Dongliang},
  timestamp = {2017.10.09},
}

@InProceedings{Neun2005,
  author               = {Neun, M. and Steiniger, S.},
  title                = {Modelling cartographic relations for categorical maps},
  booktitle            = {Proc.\ 22nd International Cartographic Conference ({ICC})},
  year                 = {2005},
  address              = {La Coru{\~n}a, Spain},
  organization         = {International Cartographic Association},
  citeulike-article-id = {3811964},
  keywords             = {generalisation, land-use, relations, spatial-analysis},
  owner                = {Dongliang},
  pagetotal            = {11},
  posted-at            = {2008-12-19 16:53:06},
  timestamp            = {2017.04.21},
  url                  = {https://pdfs.semanticscholar.org/9a01/8ad46302a91857c43c8b40bd1f7e54b70eeb.pdf},
}

@PhdThesis{Noellenburg2009Thesis,
  author    = {N{\"o}llenburg, Martin},
  title     = {Network Visualization: Algorithms, Applications, and Complexity},
  school    = {Karlsruhe Institute of Technology},
  year      = {2009},
  type      = {phdthesis},
  keywords  = {Netzwerkvisualisierung, Graphenzeichnen, algorithmische Geometrie},
  language  = {english},
  location  = {Karlsruhe, Germany},
  publisher = {{Karlsruhe}},
  url       = {https://publikationen.bibliothek.kit.edu/1000011456},
}

@Article{Noellenburg2008,
  author    = {N{\"o}llenburg, Martin and Merrick, Damian and Wolff, Alexander and Benkert, Marc},
  title     = {Morphing Polylines: {A} Step Towards Continuous Generalization},
  journal   = {Computers, Environment and Urban Systems},
  year      = {2008},
  volume    = {32},
  number    = {4},
  pages     = {248--260},
  comment   = {10.1016/j.compenvurbsys.2008.06.004},
  doi       = {10/c7fgrw},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.sciencedirect.com/science/article/pii/S0198971508000331},
}

@Article{Oehrlein2017Aggregation,
  author    = {Johannes Oehrlein and Jan-Henrik Haunert},
  title     = {A cutting-plane method for contiguity-constrained spatial aggregation},
  journal   = {Journal of Spatial Information Science},
  year      = {2017},
  number    = {15},
  pages     = {89--120},
  doi       = {10.5311/JOSIS.2017.15.379},
  owner     = {Dongliang},
  timestamp = {2018.01.05},
}

@Article{Palfrader2015,
  author    = {Peter Palfrader and Martin Held},
  title     = {Computing Mitered Offset Curves Based on Straight Skeletons},
  journal   = {Computer-Aided Design and Applications},
  year      = {2015},
  volume    = {12},
  number    = {4},
  pages     = {414--424},
  comment   = {10.1080/16864360.2014.997637
10/c5zd},
  doi       = {10/c5zd},
  eprint    = {http://dx.doi.org/10.1080/16864360.2014.997637},
  owner     = {Dongliang},
  timestamp = {2017.03.31},
  url       = {http://dx.doi.org/10.1080/16864360.2014.997637},
}

@InCollection{Pantazis2009a,
  author    = {Pantazis, DN and Koukofikis, Ath and Karathanasis, B and Kassoli, M},
  title     = {Are the morphing techniques useful for cartographic generalization?},
  booktitle = {Urban and Regional Data Management},
  publisher = {CRC Press},
  year      = {2009},
  pages     = {195--204},
  month     = {jun},
  doi       = {10.1201/9780203869352.ch18},
  issn      = {978-0-415-55642-2},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1201/9780203869352.ch18},
}

@InProceedings{Pantazis2009b,
  author    = {D.N. Pantazis and B. Karathanasis and M. Kassoli and Ath. Koukofikis and P. Stratakis},
  title     = {Morphing techniques: {T}owards new methods for raster based cartographic generalization},
  booktitle = {Proc.\ 24th International Cartographic Conference ({ICC})},
  year      = {2009},
  address   = {Santiago, Chile},
  month     = nov,
  comment   = {15¨C21 November},
  owner     = {Dongliang},
  pagetotal = {11},
  timestamp = {2017.04.28},
  url       = {https://icaci.org/files/documents/ICC_proceedings/ICC2009/html/refer/19_5.pdf},
}

@Article{Papadimitriou1981IP,
  author     = {Papadimitriou, Christos H.},
  title      = {On the Complexity of Integer Programming},
  journal    = {Journal of the Association for Computing Machinery},
  year       = {1981},
  volume     = {28},
  number     = {4},
  pages      = {765--768},
  month      = oct,
  issn       = {0004-5411},
  acmid      = {322287},
  address    = {New York, NY, USA},
  doi        = {10.1145/322276.322287},
  issue_date = {Oct. 1981},
  numpages   = {4},
  publisher  = {ACM},
  url        = {http://doi.acm.org/10.1145/322276.322287},
}

@Book{Papadimitriou1982combinatorial,
  title     = {Combinatorial Optimization: {Algorithms} and Complexity},
  publisher = {Dover Publications},
  year      = {1982},
  author    = {Papadimitriou, Christos H. and Steiglitz, Kenneth},
  series    = {Dover Books on Computer Science Series},
  isbn      = {9780486402581},
  lccn      = {98021476},
  owner     = {Dongliang},
  timestamp = {2017.09.26},
}

@Unpublished{PatelAStar,
  author  = {Amit Patel},
  title   = {Amit's {A}{$^{\!\star}$\xspace} Pages},
  note    = {Accessed: Jul 26, 2018},
  comment = {include \usepackage{xspace}},
  url     = {http://theory.stanford.edu/~amitp/GameProgramming},
}

@PhdThesis{Peng2019Thesis,
  author = {Peng, Dongliang},
  title  = {An Optimization-Based Approach for Continuous Map Generalization},
  school = {University of W\"urzburg},
  year   = {2019},
  type   = {phdthesis},
  month  = dec,
  doi    = {10.25972/WUP-978-3-95826-105-1},
  url    = {https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/17442},
}

@InProceedings{Peng2013Similarity,
  author    = {Dongliang Peng and Min Deng},
  title     = {A method of measuring shape similarity between multi-scale objects},
  booktitle = {Proc.\ 12th International Conference on GeoComputation},
  year      = {2013},
  address   = {Wuhan, China},
  comment   = {May 23--25},
  owner     = {Dongliang},
  pagetotal = {6},
  timestamp = {2017.04.28},
  url       = {http://www.geocomputation.org/2013/papers/127.pdf},
}

@InProceedings{Peng2017Building,
  author    = {Dongliang Peng and Guillaume Touya},
  title     = {Continuously Generalizing Buildings to Built-up Areas by Aggregating and Growing},
  booktitle = {Proc.\ 3rd {ACM SIGSPATIAL} Workshop on Smart Cities and Urban Analytics ({UrbanGIS})},
  year      = {2017},
  address   = {Redondo Beach, CA, USA.},
  month     = nov,
  publisher = {{ACM}},
  comment   = {November 07 -- 10},
  doi       = {10.1145/3152178.3152188},
  owner     = {Dongliang},
  pagetotal = {8},
  timestamp = {2017.10.20},
}

@InProceedings{Peng2014DataStr,
  author    = {Peng, Dongliang and Wolff, Alexander},
  title     = {Watch your data structures!},
  booktitle = {Proc.\ 22nd Annual Conference of the {GIS} Research {UK} ({GISRUK})},
  year      = {2014},
  editor    = {Jane Drummond},
  pages     = {371--381},
  address   = {Glasgow, UK},
  comment   = {April 16--18},
  confmonth = {apr},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.gla.ac.uk/media/media_401742_en.pdf},
}

@InProceedings{Peng2017AStar,
  author    = {Peng, Dongliang and Wolff, Alexander and Haunert, Jan-Henrik},
  title     = {Using the {A}{$^{\!\star}$\xspace} Algorithm to Find Optimal Sequences for Area Aggregation},
  booktitle = {Proc.\ 28th International Cartographic Conference ({ICC}), Advances in Cartography and GIScience},
  year      = {2017},
  editor    = {Michael P. Peterson},
  series    = {Lecture Notes in Geoinformation and Cartography},
  pages     = {389--404},
  address   = {Washington DC, USA},
  month     = jul,
  publisher = {Springer},
  comment   = {July 2--7; include \usepackage{xspace}
Advances in Cartography and GIScience: Selections from the International Cartographic Conference 2017 ({ICC'}17)},
  doi       = {10.1007/978-3-319-57336-6_27},
  isbn      = {978-3-319-33783-8},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@InProceedings{Peng2016Admin,
  author    = {Peng, Dongliang and Wolff, Alexander and Haunert, Jan-Henrik},
  title     = {Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations},
  booktitle = {Proc.\ 19th {AGILE} Conference on Geographic Information Science, Geospatial Data in a Changing World},
  year      = {2016},
  editor    = {Sarjakoski, Tapani and Santos, Yasmina Maribel and Sarjakoski, Tiina L.},
  series    = {Lecture Notes in Geoinformation and Cartography},
  pages     = {399--415},
  address   = {Helsinki, Finland},
  publisher = {Springer},
  comment   = {10.1007/978-3-319-33783-8_23
June 14--17
Geospatial Data in a Changing World: Selected Papers of the 19th {AGILE} Conference on Geographic Information Science ({AGILE'16})},
  doi       = {10/c5kh},
  isbn      = {978-3-319-33783-8},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Peng2014Sufficiently,
  author    = {Dongliang Peng and Min Deng and Huimin Liu},
  title     = {Morphing Transformation of Linear Features by Using Independent Bend Structures More Sufficiently {(in Chinese)}},
  journal   = {Acta Geodaetica et Cartographica Sinica},
  year      = {2014},
  volume    = {43},
  number    = {6},
  pages     = {637--644},
  doi       = {10.13485/j.cnki.11-2089.2014.0100},
  owner     = {PDL},
  timestamp = {2017.03.12},
  url       = {http://xb.sinomaps.com/CN/Y2014/V43/I6/637},
}

@Article{Peng2013Law,
  author    = {Dongliang Peng and Huimin Liu and Min Deng and Siyang Liu},
  title     = {An Investigation on the Change Law of Lengths of Interpolated Linear Features in Morphing Transformation {(in Chinese)}},
  journal   = {Geography and Geo-Information Science},
  year      = {2013},
  volume    = {29},
  number    = {1},
  pages     = {22--27},
  doi       = {10.7702/dlydIxxkx20130105},
  owner     = {PDL},
  timestamp = {2017.03.12},
}

@InProceedings{Peng2013LSA,
  author    = {Peng, Dongliang and Haunert, Jan-Henrik and Wolff, Alexander and Hurter, Christophe},
  title     = {Morphing polylines based on least squares adjustment},
  booktitle = {Proc.\ 16th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2013},
  month     = aug,
  comment   = {August 23--24},
  location  = {Dresden, Germany},
  owner     = {Dongliang},
  pagetotal = {10},
  timestamp = {2017.04.28},
  url       = {https://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2013/genemappro2013_submission_6.pdf},
}

@Article{Peng2012River,
  author    = {Dongliang Peng and Min Deng and Binbin Zhao},
  title     = {Multi-scale transformation of river networks based on morphing technology},
  journal   = {Journal of Remote Sensing},
  year      = {2012},
  volume    = {16},
  number    = {5},
  pages     = {953--968},
  comment   = {invalid DOI: 10.11834/jrs.20121272},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.jors.cn/jrs/ch/reader/view_abstract.aspx?file_no=r11272&flag=1},
}

@InProceedings{Peng2011Bend,
  author    = {Peng, Dongliang and Deng, Min and Xu, Zhen and Liu, Huimin},
  title     = {A new morphing method of linear features based on bend structures},
  booktitle = {Proc.\ {ISPRS} Workshop on Dynamic and Multi-Dimensional GIS},
  year      = {2011},
  address   = {Shanghai, China},
  comment   = {October 17--18},
  owner     = {Dongliang},
  pagetotal = {6},
  timestamp = {2017.04.28},
}

@InProceedings{Pohl1973,
  author    = {Pohl, Ira},
  title     = {The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving},
  booktitle = {Proc.\ 3rd International Joint Conference on Artificial Intelligence ({IJCAI})},
  year      = {1973},
  pages     = {12--17},
  address   = {Stanford, CA, USA},
  publisher = {Morgan Kaufmann Publishers Inc.},
  acmid     = {1624777},
  keywords  = {HPA, artificial intelligence, binary tree sort, branch and bound, dynamic weighting, heuristic combinatorics, heuristic search, preconditioning, pruning, traveling salesman problem},
  numpages  = {6},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://exhibits.stanford.edu/feigenbaum/catalog/sq127cx4634},
}

@Article{Prim1957,
  author    = {Prim, Robert C.},
  title     = {Shortest connection networks and some generalizations},
  journal   = {The Bell System Technical Journal},
  year      = {1957},
  volume    = {36},
  number    = {6},
  pages     = {1389--1401},
  issn      = {0005-8580},
  comment   = {Nov},
  doi       = {10.1002/j.1538-7305.1957.tb01515.x},
  owner     = {Dongliang},
  timestamp = {2017.09.21},
}

@Article{Rada1989SemanticMetric,
  author   = {Rada, Roy and Mili, Hafedh and Bicknell, Ellen and Blettner, Maria},
  title    = {{Development and application of a metric on semantic nets}},
  journal  = {{IEEE} Transactions On Systems Man And Cybernetics},
  year     = {1989},
  volume   = {19},
  number   = {1},
  pages    = {17--30},
  issn     = {00189472},
  abstract = {Motivated by the properties of spreading activation and conceptual distance, the authors propose a metric, called distance, on the power set of nodes in a semantic net. Distance is the average minimum path length over all pairwise combinations of nodes between two subsets of nodes. Distance can be successfully used to assess the conceptual distance between sets of concepts when used on a semantic net of hierarchical relations. When other kinds of relationships, like `cause', are used, distance must be amended but then can again be effective. The judgements of distance significantly correlate with the distance judgements that people make and help to determine whether one semantic net is better or worse than another. The authors focus on the mathematical characteristics of distance that presents novel cases and interpretations. Experiments in which distance is applied to pairs of concepts and to sets of concepts in a hierarchical knowledge base show the power of hierarchical relations in representing information about the conceptual distance between concepts},
  doi      = {10.1109/21.24528},
  url      = {https://ieeexplore.ieee.org/document/24528/},
}

@InProceedings{Rahmati2013,
  author    = {Rahmati, Zahed and King, Valerie and Whitesides, Sue},
  title     = {Kinetic Data Structures for All Nearest Neighbors and Closest Pair in the Plane},
  booktitle = {Proc.\ 29th Annual Symposium on Computational Geometry ({SoCG})},
  year      = {2013},
  pages     = {137--144},
  address   = {Rio de Janeiro, Brazil},
  publisher = {ACM},
  acmid     = {2462378},
  doi       = {10.1145/2462356.2462378},
  isbn      = {978-1-4503-2031-3},
  keywords  = {all nearest neighbors, closest pair, delaunay triangulation, kinetic algorithm, pie delaunay graph, theta graph},
  numpages  = {8},
  owner     = {Dongliang},
  timestamp = {2017.10.20},
  url       = {http://doi.acm.org/10.1145/2462356.2462378},
}

@Article{Regnauld2001,
  author    = {Regnauld, Nicolas},
  journal   = {Algorithmica},
  title     = {Contextual Building Typification in Automated Map Generalization},
  year      = {2001},
  issn      = {1432-0541},
  number    = {2},
  pages     = {312--333},
  volume    = {30},
  abstract  = {Cartographic generalization aims to represent geographical information on a map whose specifications are different from those of the original database. Generalization often implies scale reduction, which generates legibility problems. To be readable at smaller scale, geographical objects often need to be enlarged, which generates problems of overlapping features or map congestion. To manage this problem with respect to buildings, we present a method of selection based on the typification principle that creates a result with fewer objects, but preserves the initial pattern of distribution. For this we use a graph of proximity on the building set, which is analysed and segmented with respect to various criteria, taken from gestalt theory. This analysis provides geographical information that is attached to each group of buildings such as the mean size of buildings, shape of the group, and density. This information is independent of scale. The information from the analysis stage is used to define methods to represent them at the target scale. The aim is to preserve the pattern as far as possible, preserve similarities and differences between the groups with regard to density, size and orientation of buildings. We present some results that have been obtained using the platform Strat{\`e}ge, developed in the COGIT laboratory at the Institut G{\'e}ographique National, Paris.},
  comment   = {Jun},
  day       = {01},
  doi       = {10.1007/s00453-001-0008-8},
  owner     = {Dongliang},
  timestamp = {2017.08.24},
  url       = {https://doi.org/10.1007/s00453-001-0008-8},
}

@InProceedings{Regnauld1996,
  author    = {Nicolas Regnauld},
  booktitle = {Proc.\ 7th International Symposium on Spatial Data Handling {(SDH)}, Advances in {GIS} Research {II}},
  title     = {Recognition of building clusters for generalization},
  year      = {1996},
  address   = {Delft, The Netherlands},
  editor    = {Kraak, MJ and Molenaar, M},
  month     = aug,
  pages     = {4B.~1--4B.~14},
  publisher = {Taylor \& Francis},
  comment   = {12-16 August},
  owner     = {Dongliang},
  timestamp = {2017.05.17},
  url       = {https://www.oicrf.org/-/recognition-of-building-clusters-for-generalization},
}



@InProceedings{Reilly2004,
  author    = {Derek F. Reilly and Kori Inkpen},
  title     = {Map morphing: making sense of incongruent maps},
  booktitle = {Proc.\ Graphics Interface ({GI})},
  year      = {2004},
  editor    = {Wolfgang Heidrich and Ravin Balakrishnan},
  pages     = {231--238},
  address   = {London, Ontario},
  month     = may,
  publisher = {Canadian Human-Computer Communications Society},
  comment   = {May 17-19},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://dl.acm.org/citation.cfm?id=1006086},
}

@TechReport{Ruas2001Report,
  author      = {Anne Ruas},
  institution = {European Organization for Experimental Photogrammetric Research ({OEEPE})},
  title       = {Automatic Generalisation Project: {Learning} Process from InteractiveGeneralisation},
  year        = {2001},
  number      = {Official Publication 39},
  type        = {resreport},
}

@Article{Ruiz2011Conflation,
  author    = {Juan J. Ruiz and F. Javier Ariza and Manuel A. Ure{\~n}a and Elidia B. Bl{\'a}zquez},
  title     = {Digital map conflation: {a} review of the process and a proposal for classification},
  journal   = {International Journal of Geographical Information Science},
  year      = {2011},
  volume    = {25},
  number    = {9},
  pages     = {1439--1466},
  doi       = {10.1080/13658816.2010.519707},
  owner     = {Dongliang},
  publisher = {Taylor \& Francis},
  timestamp = {2017.10.16},
  url       = {http://dx.doi.org/10.1080/13658816.2010.519707},
}

@Article{Saalfeld1999,
  author    = {Saalfeld, Alan},
  title     = {Topologically consistent line simplification with the {D}ouglas--{P}eucker Algorithm},
  journal   = {Cartography and Geographic Information Science},
  year      = {1999},
  volume    = {26},
  number    = {1},
  pages     = {7--18},
  doi       = {10/drcc5h},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.tandfonline.com/doi/abs/10.1559/152304099782424901},
}

@Article{Saalfeld1988,
  author    = {Alan Saalfeld},
  title     = {Conflation Automated map compilation},
  journal   = {International Journal of Geographical Information Systems},
  year      = {1988},
  volume    = {2},
  number    = {3},
  pages     = {217--228},
  doi       = {10.1080/02693798808927897},
  eprint    = {http://dx.doi.org/10.1080/02693798808927897},
  owner     = {Dongliang},
  publisher = {Taylor \& Francis},
  timestamp = {2017.10.16},
  url       = {http://dx.doi.org/10.1080/02693798808927897},
}

@Article{Saalfeld1985-RS,
  author    = {Saalfeld, Alan},
  title     = {A fast rubber-sheeting transformation using simplicial coordinates},
  journal   = {The American Cartographer},
  year      = {1985},
  volume    = {12},
  number    = {2},
  pages     = {169--173},
  doi       = {10/cs5dt3},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.tandfonline.com/doi/abs/10.1559/152304085783915072},
}

@Article{Safra2013,
  author    = {E. Safra and Y. Kanza and Y. Sagiv and Y. Doytsher},
  journal   = {International Journal of Geographical Information Science},
  title     = {Ad hoc matching of vectorial road networks},
  year      = {2013},
  number    = {1},
  pages     = {114--153},
  volume    = {27},
  doi       = {10.1080/13658816.2012.667104},
  eprint    = {http://dx.doi.org/10.1080/13658816.2012.667104},
  owner     = {Dongliang},
  publisher = {Taylor \& Francis},
  timestamp = {2017.10.14},
  url       = {http://dx.doi.org/10.1080/13658816.2012.667104},
}

@InProceedings{Samsonov2016,
  author    = {Timofey Samsonov and Olga Yakimova},
  title     = {Geometric Simplification of Administrative Borders With Mixture of Irregular and Orthogonal Segments},
  booktitle = {Proc.\ 19th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2016},
  address   = {Helsinki, Finland},
  comment   = {June 14},
  owner     = {Dongliang},
  pagetotal = {12},
  timestamp = {2017.04.28},
  url       = {https://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2016/genemr2016_paper_12.pdf},
}

@Article{Schneider2015,
  author    = {Teseo Schneider and Kai Hormann},
  title     = {Smooth bijective maps between arbitrary planar polygons},
  journal   = {Computer Aided Geometric Design},
  year      = {2015},
  volume    = {35--36},
  pages     = {243--354},
  issn      = {0167-8396},
  comment   = {Geometric Modeling and Processing 2015},
  doi       = {10.1016/j.cagd.2015.03.010},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.sciencedirect.com/science/article/pii/S0167839615000333},
}

@Book{Schrijver1986,
  title     = {Theory of Linear and Integer Programming},
  publisher = {John Wiley \& Sons, Inc.},
  year      = {1986},
  author    = {Schrijver, Alexander},
  address   = {New York, NY, USA},
  isbn      = {0-471-90854-1},
  comment   = {https://dl.acm.org/citation.cfm?id=17634},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
  url       = {https://promathmedia.files.wordpress.com/2013/10/alexander_schrijver_theory_of_linear_and_integerbookfi-org.pdf},
}

@InProceedings{sahw-oarps-ICAGW13,
  author    = {Schwartges, Nadine and Allerkamp, Dennis and Haunert, Jan-Henrik and Wolff, Alexander},
  title     = {Optimizing Active Ranges for Point Selection in Dynamic Maps},
  booktitle = {Proc.\ 16th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2013},
  added-at  = {2017-05-19T17:27:56.000+0200},
  biburl    = {https://www.bibsonomy.org/bibtex/2531d801076c31c22bd627d965f761fea/awolff},
  location  = {Dresden, Germany},
  owner     = {Dongliang},
  pagetotal = {10},
  slides    = {http://generalisation.icaci.org/images/files/workshop/workshop2013/slides/slides-schwartges.pdf},
  timestamp = {2017-05-19T17:28:27.000+0200},
  url       = {https://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2013/genemappro2013_submission_5.pdf},
}

@InProceedings{Schwarzkopf1995Ipe,
  author    = {Schwarzkopf, Otfried},
  title     = {The Extensible Drawing Editor {I}pe},
  booktitle = {Proc.\ 11th Annual Symposium on Computational Geometry ({SCG})},
  year      = {1995},
  pages     = {410--411},
  address   = {New York, NY, USA},
  publisher = {ACM},
  acmid     = {220326},
  comment   = {location  = {Vancouver, British Columbia, Canada},},
  doi       = {10.1145/220279.220326},
  isbn      = {0-89791-724-3},
  numpages  = {2},
  url       = {http://doi.acm.org/10.1145/220279.220326},
}

@Article{Schwering2008,
  author    = {Schwering, Angela},
  title     = {Approaches to semantic similarity measurement for geo-spatial data: a survey},
  journal   = {Transactions in GIS},
  year      = {2008},
  volume    = {12},
  number    = {1},
  pages     = {5--29},
  issn      = {1467-9671},
  doi       = {10.1111/j.1467-9671.2008.01084.x},
  owner     = {Dongliang},
  publisher = {Blackwell Publishing Ltd},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1111/j.1467-9671.2008.01084.x},
}

@InProceedings{Sederberg1993,
  author    = {Sederberg, Thomas W. and Gao, Peisheng and Wang, Guojin and Mu, Hong},
  title     = {2-{D} Shape Blending: {An} Intrinsic Solution to the Vertex Path Problem},
  booktitle = {Proc.\ 20th Annual Conference on Computer Graphics and Interactive Techniques ({SIGGRAPH})},
  year      = {1993},
  pages     = {15--18},
  address   = {Anaheim, CA, USA},
  publisher = {ACM},
  acmid     = {166118},
  doi       = {10.1145/166117.166118},
  isbn      = {0-89791-601-8},
  keywords  = {character animation, numerical algorithms, shape blending},
  numpages  = {4},
  owner     = {Dongliang},
  timestamp = {2017.10.17},
  url       = {http://doi.acm.org/10.1145/166117.166118},
}

@Article{Sester2005Optimization,
  author    = {Monika Sester},
  title     = {Optimization approaches for generalization and data abstraction},
  journal   = {International Journal of Geographical Information Science},
  year      = {2005},
  volume    = {19},
  number    = {8--9},
  pages     = {871--897},
  doi       = {10.1080/13658810500161179},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://www.tandfonline.com/doi/abs/10.1080/13658810500161179},
}

@InProceedings{Sester2000,
  author    = {Sester, Monika},
  title     = {Generalization based on least squares adjustment},
  booktitle = {Proc.\ 19th {ISPRS} Congress},
  year      = {2000},
  editor    = {Fritsch, D and Molenaar, M},
  volume    = {XXXIII ({Part B4})},
  series    = {International Archives of Photogrammetry and Remote Sensing},
  pages     = {931--938},
  address   = {Amsterdam, The Netherlands},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.isprs.org/proceedings/Xxxiii/congress/part4/931_XXXIII-part4.pdf},
}

@InProceedings{Sester2005_CG,
  author    = {Sester, Monika and Brenner, Claus},
  title     = {Continuous Generalization for Visualization on Small Mobile Devices},
  booktitle = {Proc.\ 11th International Symposium on Spatial Data Handling ({SDH})},
  year      = {2005},
  editor    = {Peter Fisher},
  pages     = {355--368},
  address   = {Leicester, UK},
  publisher = {Springer},
  abstract  = {Visualizing spatial information on small mobile displays is a big chance and challenge at the same time. In order to address the tradeoff between huge spatial data sets and small storage capacities and visualization screens, we propose to visualize only the information on the screen which adequately fits the current resolution. To realize this, we automatically decompose the generalization of an object into a sequence of elementary steps. From this, one can later easily obtain any desired generalization level by applying the appropriate subpart of the sequence. The method method does not only lead to smooth transitions between different object representations but also is useful for incremental transmission of maps through limited bandwidth channels.},
  comment   = {Aug 23--25, 2004
Developments in Spatial Data Handling: 11th International Symposium on Spatial Data Handling ({SDH'05})
Springer Science \& Business Media},
  doi       = {10.1007/3-540-26772-7_27},
  isbn      = {978-3-540-26772-0},
  owner     = {Dongliang},
  timestamp = {2017.07.17},
  url       = {http://dx.doi.org/10.1007/3-540-26772-7_27},
}

@InProceedings{Sester2004,
  author    = {M. Sester and C. Brenner},
  title     = {Continuous generalization for fast and smooth visualization on small displays},
  booktitle = {Proc.\ 20th {ISPRS} Congress},
  year      = {2004},
  editor    = {O. Altan},
  volume    = {XXXV (Part B4)},
  series    = {International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences},
  pages     = {1293--1298},
  address   = {Istanbul, Turkey},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.9129},
}

@InProceedings{Shamos1976,
  author    = {M. I. Shamos and D. Hoey},
  title     = {Geometric intersection problems},
  booktitle = {Proc.\ 17th Annual Symposium on Foundations of Computer Science ({SFCS})},
  year      = {1976},
  pages     = {208--215},
  month     = oct,
  publisher = {{IEEE}},
  comment   = {25-27 Oct},
  doi       = {10.1109/SFCS.1976.16},
  issn      = {0272-5428},
  keywords  = {Application software;Computational geometry;Computer graphics;Computer science;Displays;Layout;Linear programming;Mathematics;Operations research;Wire},
  owner     = {Dongliang},
  timestamp = {2017.10.17},
}

@InProceedings{Shamos1975,
  author    = {M. I. Shamos and D. Hoey},
  title     = {Closest-point problems},
  booktitle = {Proc.\ 16th Annual Symposium on Foundations of Computer Science ({SFCS})},
  year      = {1975},
  pages     = {151--162},
  publisher = {{IEEE}},
  comment   = {Oct},
  doi       = {10.1109/SFCS.1975.8},
  issn      = {0272-5428},
  keywords  = {Algorithm design and analysis;Clustering algorithms;Computational geometry;Computer science;Design optimization;Linear programming;Manufacturing;Tree graphs;Upper bound;Wire},
  owner     = {Dongliang},
  timestamp = {2017.10.20},
}

@InProceedings{Shimizu03rubber-sheetingof,
  author    = {Eihan Shimizu and Takashi Fuse},
  title     = {Rubber-sheeting of historical maps in {GIS} and its application to landscape visualization of old-time cities: focusing on {T}okyo of the past},
  booktitle = {Proc.\ 8th International Conference on Computers in Urban Planning and Urban Management},
  year      = {2003},
  volume    = {11A-3},
  address   = {Sendai, Japan},
  owner     = {Dongliang},
  pagetotal = {8},
  timestamp = {2017.04.28},
  url       = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.545.7940},
}

@Article{Shirabe2005Contiguity,
  author    = {Shirabe, Takeshi},
  title     = {A Model of Contiguity for Spatial Unit Allocation},
  journal   = {Geographical Analysis},
  year      = {2005},
  volume    = {37},
  number    = {1},
  pages     = {2--16},
  issn      = {1538-4632},
  comment   = {http://dx.doi.org/10.1111/j.1538-4632.2005.00605.x},
  doi       = {10.1111/j.1538-4632.2005.00605.x},
  owner     = {Dongliang},
  publisher = {Blackwell Publishing},
  timestamp = {2017.11.22},
}

@Book{Slocum2008,
  title        = {Thematic Cartography and Geovisualization},
  publisher    = {Prentice Hall},
  year         = {2008},
  author       = {Slocum, Terry A. and Mcmaster, Robert B. and Kessler, Fritz C. and Howard, Hugh H.},
  edition      = {3},
  month        = {apr},
  isbn         = {0132298341},
  howpublished = {Hardcover},
  owner        = {Dongliang},
  timestamp    = {2017.04.28},
}

@Article{Smith2007MasterMap,
  author    = {Geoff Smith and Matt Beare and Mike Boyd and Tim Downs and Martin Gregory and Dan Morton and Nigel Brown and Andy Thomson},
  title     = {{UK} Land Cover Map Production Through the Generalisation of {OS} {MasterMap}\textsuperscript{{\textregistered}}},
  journal   = {The Cartographic Journal},
  year      = {2007},
  volume    = {44},
  number    = {3},
  pages     = {276--283},
  doi       = {10.1179/000870407X241827},
  eprint    = {https://doi.org/10.1179/000870407X241827},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1179/000870407X241827},
}

@Article{Stoter2009,
  author    = {Jantien Stoter and Dirk Burghardt and C{\'e}cile Duch{\^e}ne and Blanca Baella and Nico Bakker and Connie Blok and Maria Pla and Nicolas Regnauld and Guillaume Touya and Stefan Schmid},
  title     = {Methodology for evaluating automated map generalization in commercial software},
  journal   = {Computers, Environment and Urban Systems},
  year      = {2009},
  volume    = {33},
  number    = {5},
  pages     = {311--324},
  issn      = {0198-9715},
  note      = {Geo-information Generalisation and Multiple Representation},
  doi       = {10.1016/j.compenvurbsys.2009.06.002},
  keywords  = {\{NMA\} requirements for automated map generalization},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://www.sciencedirect.com/science/article/pii/S0198971509000465},
}

@Article{Stoter2009Requirements,
  author    = {Jantien Stoter and van Smaalen, John and Nico Bakker and Paul Hardy},
  title     = {Specifying Map Requirements for Automated Generalization of Topographic Data},
  journal   = {The Cartographic Journal},
  year      = {2009},
  volume    = {46},
  number    = {3},
  pages     = {214--227},
  comment   = {10.1179/174327709X446637
10/fttg54
https://doi.org/10.1179/174327709X446637},
  doi       = {10/fttg54},
  eprint    = {https://doi.org/10.1179/174327709X446637},
  publisher = {Taylor \& Francis},
  url       = {http://doi.org/fttg54},
}

@InCollection{Stoter2014Evaluation,
  author    = {Stoter, Jantien and Zhang, Xiang and Stigmar, Hanna and Harrie, Lars},
  booktitle = {Abstracting Geographic Information in a Data Rich World: Methodologies and Applications of Map Generalisation},
  publisher = {Springer International Publishing},
  title     = {Evaluation in Generalisation},
  year      = {2014},
  address   = {Cham},
  chapter   = {9},
  editor    = {Burghardt, Dirk and Duch{\^e}ne, C{\'e}cile and Mackaness, William},
  isbn      = {978-3-319-00203-3},
  pages     = {259--297},
  doi       = {10.1007/978-3-319-00203-3_9},
  url       = {https://doi.org/10.1007/978-3-319-00203-3_9},
}

@InProceedings{Streinu2000,
  author    = {Ileana Streinu},
  title     = {A combinatorial approach to planar non-colliding robot arm motion planning},
  booktitle = {Proc.\ 41st Annual Symposium on Foundations of Computer Science ({FOCS})},
  year      = {2000},
  pages     = {443--453},
  address   = {Redondo Beach, USA},
  month     = nov,
  comment   = {12-14 Nov},
  doi       = {10.1109/SFCS.2000.892132},
  owner     = {Dongliang},
  timestamp = {2017.10.09},
}

@PhdThesis{Suba2017Thesis,
  author = {Radan \v{S}uba},
  title  = {Design and development of a system for vario-scale maps},
  school = {Delft University of Technology},
  year   = {2017},
  type   = {phdthesis},
  doi    = {10.7480/abe.2017.18.1877},
  url    = {https://journals.open.tudelft.nl/abe/article/view/1877},
}

@Article{Suba2016Road,
  author    = {\v{S}uba, Radan and Meijers, Martijn and van Oosterom, Peter},
  title     = {Continuous Road Network Generalization throughout All Scales},
  journal   = {{ISPRS} International Journal of Geo-Information},
  year      = {2016},
  volume    = {5},
  number    = {8},
  issn      = {2220-9964},
  abstract  = {Until now, road network generalization has mainly been applied to the task of generalizing from one fixed source scale to another fixed target scale. These actions result in large differences in content and representation, e.g., a sudden change of the representation of road segments from areas to lines, which may confuse users. Therefore, we aim at the continuous generalization of a road network for the whole range, from the large scale, where roads are represented as areas, to mid- and small scales, where roads are represented progressively more frequently as lines. As a consequence of this process, there is an intermediate scale range where at the same time some roads will be represented as areas, while others will be represented as lines. We propose a new data model together with a specific data structure where for all map objects, a range of valid map scales is stored. This model is based on the integrated and explicit representation of: (1) a planar area partition; and (2) a linear road network. This enables the generalization process to include the knowledge and understanding of a linear network. This paper further discusses the actual generalization options and algorithms for populating this data structure with high quality vario-scale cartographic content.},
  doi       = {10.3390/ijgi5080145},
  owner     = {Dongliang},
  pagetotal = {21},
  timestamp = {2017.11.22},
  url       = {http://www.mdpi.com/2220-9964/5/8/145},
}

@InProceedings{Suba2016Usability,
  author    = {\v{S}uba, Radan and Driel, Mattijs and Meijers, Martijn and Eisemann, Elmar and van Oosterom, Peter},
  booktitle = {Proc.\ 19th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  title     = {Usability test plan for truly vario-scale maps},
  year      = {2016},
  address   = {Helsinki, Finland},
  comment   = {http://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2016/genemr2016_paper_08.pdf
https://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2016/genemr2016_paper_08.pdf
http://www.gdmc.nl/publications/2016/Usability_Test_Plan_Vario-scale_Maps.pdf},
  owner     = {Dongliang},
  pagetotal = {10},
  timestamp = {2017.04.28},
  url       = {https://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2016/genemr2016_paper_08.pdf},
}

@InProceedings{Suba2014Merge,
  author    = {\v{S}uba, Radan and Meijers, Martijn and Huang, Lina and van Oosterom, Peter},
  title     = {An area merge operation for smooth zooming},
  booktitle = {Proc.\ 17th {AGILE} Conference on Geographic Information Science, Connecting a Digital Europe Through Location and Place},
  year      = {2014},
  editor    = {Huerta, Joaqu{\'i}n and Schade, Sven and Granell, Carlos},
  series    = {Lecture Notes in Geoinformation and Cartography},
  pages     = {275--293},
  address   = {Cham},
  publisher = {Springer},
  doi       = {978-3-319-03611-3_16},
  isbn      = {978-3-319-03611-3},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1007/978-3-319-03611-3_16},
}

@InProceedings{Suba2013Vario,
  author    = {\v{S}uba, Radan and Meijers, Martijn and van Oosterom, Peter},
  title     = {2D vario-scale representations based on real {3D} structure},
  booktitle = {Proc.\ 16th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2013},
  month     = aug,
  comment   = {August 23--24},
  location  = {Dresden, Germany},
  owner     = {Dongliang},
  pagetotal = {10},
  url       = {https://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2013/genemappro2013_submission_4.pdf},
}

@Article{Surazhsky2001,
  author    = {Surazhsky, Vitaly and Gotsman, Craig},
  title     = {Controllable morphing of compatible planar triangulations},
  journal   = {ACM Transactions on Graphics},
  year      = {2001},
  volume    = {20},
  number    = {4},
  pages     = {203--231},
  doi       = {10.1145/502783.502784},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Surazhsky2004HighQuality,
  author   = {Surazhsky, Vitaly and Gotsman, Craig},
  title    = {High quality compatible triangulations},
  journal  = {Engineering with Computers},
  year     = {2004},
  volume   = {20},
  number   = {2},
  pages    = {147--156},
  month    = jul,
  issn     = {1435-5663},
  abstract = {Compatible meshes are isomorphic meshings of the interiors of two polygons having a correspondence between their vertices. Compatible meshing may be used for constructing sweeps, suitable for finite element analysis, between two base polygons. They may also be used for meshing a given sequence of polygons forming a sweep. We present a method to compute compatible triangulations of planar polygons, sometimes requiring extra (Steiner) vertices. Experimental results show that for typical real-life inputs, the number of Steiner vertices introduced is very small. However, having a small number of Steiner vertices, these compatible triangulations are usually not of high quality, i.e. they do not have well-shaped triangles. We show how to increase the quality of these triangulations by adding Steiner vertices in a compatible manner, using remeshing and mesh smoothing techniques. The total scheme results in high-quality compatible meshes with a small number of triangles. These meshes may then be morphed to obtain the intermediate triangulated sections of a sweep, if needed.},
  comment  = {10.1007/s00366-004-0282-6},
  day      = {01},
  doi      = {10/c7hfws},
  url      = {https://doi.org/10.1007/s00366-004-0282-6},
}

@Article{Surazhsky2003Intrinsic,
  author   = {Surazhsky, Vitaly and Gotsman, Craig},
  journal  = {International Journal of Shape Modeling},
  title    = {Intrinsic Morphing of Compatible Triangulations},
  year     = {2003},
  number   = {02},
  pages    = {191--201},
  volume   = {09},
  abstract = {Two planar triangulations with a correspondence between two vertex sets are compatible (isomorphic) if they are topologically equivalent. This work presents a simple and robust method for morphing two compatible planar triangulations with identical convex boundaries that locally preserves the intrinsic geometric properties of triangles throughout the morph. The method is based on the barycentric coordinates representation of planar triangulations, and thus, guarantees compatibility of all intermediate triangulations. The intrinsic properties are preserved by interpolating angles and edge lengths components of mean value barycentric coordinates, rather than interpolating the barycentric coordinates themselves. As a result, the method generates a natural-looking and guaranteed intersection-free morphing sequence.},
  doi      = {10.1142/S0218654303000115},
  eprint   = {https://doi.org/10.1142/S0218654303000115},
  url      = {https://doi.org/10.1142/S0218654303000115},
}

@InCollection{Thiemann2018LandCover,
  author    = {Thiemann, Frank and Sester, Monika},
  booktitle = {Trends in Spatial Analysis and Modelling: Decision-Support and Planning Strategies},
  publisher = {Springer},
  title     = {An Automatic Approach for Generalization of Land-Cover Data from Topographic Data},
  year      = {2018},
  chapter   = {10},
  editor    = {Behnisch, Martin and Meinel, Gotthard},
  isbn      = {978-3-319-52522-8},
  pages     = {193--207},
  series    = {Geotechnologies and the Environment},
  volume    = {19},
  abstract  = {The paper presents an approach for the automatic generalization of large land-cover datasets from topographic data using fast generalization algorithms. The generalization approach is composed of several steps consisting of topologic cleaning, aggregation, feature partitioning, identification of mixed feature classes to form heterogeneous classes and simplification of feature outlines. The workflow will be presented with examples for generating CORINE Land Cover (CLC) features from the high resolution German authoritative land-cover dataset of the whole area of Germany (DLM-DE). The results will be discussed in detail.},
  comment   = {10.1007/978-3-319-52522-8_10
Proc.\ 1st International Land Use Symposium ({ILUS'18}),},
  doi       = {10/c5kj},
  url       = {https://doi.org/10.1007/978-3-319-52522-8_10},
}

@InCollection{Thiemann2011Scalable,
  author    = {Thiemann, Frank and Warneke, Hendrik and Sester, Monika and Lipeck, Udo},
  title     = {A Scalable Approach for Generalization of Land Cover Data},
  booktitle = {Advancing Geoinformation Science for a Changing World},
  publisher = {Springer},
  year      = {2011},
  editor    = {Geertman, Stan and Reinhardt, Wolfgang and Toppen, Fred},
  series    = {Lecture Notes in Geoinformation and Cartography},
  chapter   = {10},
  pages     = {399--420},
  isbn      = {978-3-642-19789-5},
  abstract  = {The paper presents a scalable approach for generalization of large land-cover data sets using partitioning in a spatial database and fast generalization algorithms. In the partitioning step, the data set is split into rectangular overlapping tiles. These are processed independently and then composed into one result. For each tile, semantic and geometric generalization operations are performed to remove features that are too small from the data set. The generalization approach is composed of several steps consisting of topologic cleaning, aggregation, feature partitioning, identification of mixed feature classes to form heterogeneous classes, and simplification of feature outlines.},
  doi       = {10.1007/978-3-642-19789-5_20},
}

@PhdThesis{Timpf1998,
  author    = {Timpf, Sabine},
  title     = {Hierarchical Structures in Map Series},
  school    = {Technical University Vienna, Austria},
  year      = {1998},
  type      = {phdthesis},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.62.4561&rep=rep1&type=pdf},
}

@Article{Tong2015AreaLSA,
  author  = {Tong, Xiaohua and Jin, Yanmin and Li, Lingyun and Ai, Tinghua},
  title   = {Area-preservation Simplification of Polygonal Boundaries by the Use of the Structured Total Least Squares Method with Constraints},
  journal = {Transactions in GIS},
  year    = {2015},
  volume  = {19},
  number  = {5},
  pages   = {780--799},
  issn    = {1467--9671},
  doi     = {10.1111/tgis.12130},
  url     = {http://dx.doi.org/10.1111/tgis.12130},
}

@Article{Tong2014Matching,
  author    = {Xiaohua Tong and Dan Liang and Yanmin Jin},
  title     = {A linear road object matching method for conflation based on optimization and logistic regression},
  journal   = {International Journal of Geographical Information Science},
  year      = {2014},
  volume    = {28},
  number    = {4},
  pages     = {824--846},
  doi       = {10.1080/13658816.2013.876501},
  eprint    = {http://dx.doi.org/10.1080/13658816.2013.876501},
  owner     = {Dongliang},
  publisher = {Taylor \& Francis},
  timestamp = {2017.10.16},
}

@Article{Topfer1966,
  author    = {F. T{\"o}pfer and W. Pillewizer},
  title     = {The Principles of Selection},
  journal   = {The Cartographic Journal},
  year      = {1966},
  volume    = {3},
  number    = {1},
  pages     = {10--16},
  doi       = {10.1179/caj.1966.3.1.10},
  eprint    = {http://dx.doi.org/10.1179/caj.1966.3.1.10},
  owner     = {Dongliang},
  timestamp = {2017.08.30},
  url       = {http://dx.doi.org/10.1179/caj.1966.3.1.10},
}

@InProceedings{Touya2017Progressive,
  author    = {Touya, Guillaume and Dumont, Marion},
  title     = {Progressive Block Graying and Landmarks Enhancing as Intermediate Representations between Buildings and Urban Areas},
  booktitle = {Proc.\ 20th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  year      = {2017},
  month     = jul,
  comment   = {http://mapmuxing.ign.fr/pdf/ICA-Workshop-Touya-Dumont.pdf},
  location  = {Washington DC, USA},
  owner     = {Dongliang},
  pagetotal = {10},
  timestamp = {2017.09.21},
  url       = {https://kartographie.geo.tu-dresden.de/downloads/ica-gen/workshop2017/genemr2017_paper_1.pdf},
}

@Article{Touya2013ScaleMaster,
  author    = {Guillaume Touya and Jean-Fran{\c{c}}ois Girres},
  journal   = {Cartography and Geographic Information Science},
  title     = {{ScaleMaster} 2.0: {A ScaleMaster} extension to monitor automatic multi-scales generalizations},
  year      = {2013},
  number    = {3},
  pages     = {192--200},
  volume    = {40},
  doi       = {10.1080/15230406.2013.809233},
  eprint    = {https://doi.org/10.1080/15230406.2013.809233},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1080/15230406.2013.809233},
}

@Article{vanGoethem2013,
  author    = {van Goethem, Arthur and Wouter Meulemans and Andreas Reimer and Herman Haverkort and Bettina Speckmann},
  title     = {Topologically Safe Curved Schematisation},
  journal   = {The Cartographic Journal},
  year      = {2013},
  volume    = {50},
  number    = {3},
  pages     = {276--285},
  doi       = {10.1179/1743277413Y.0000000066},
  eprint    = {http://dx.doi.org/10.1179/1743277413Y.0000000066},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1179/1743277413Y.0000000066},
}

@InProceedings{vanKreveld2001,
  author    = {van Kreveld, Marc},
  booktitle = {Proc.\ 5th {ICA} Workshop on Generalisation and Multiple Representation ({ICAGM})},
  title     = {Smooth generalization for continuous zooming},
  year      = {2001},
  address   = {Beijing, China},
  month     = aug,
  comment   = {August},
  owner     = {Dongliang},
  pagetotal = {8},
  timestamp = {2017.04.28},
  url       = {http://www.staff.science.uu.nl/~kreve101/papers/smooth.pdf},
}

@Article{vanKreveld2018Simplify,
  author        = {Marc J. van Kreveld and Maarten L{\"o}ffler and Lionov Wiratma},
  title         = {On Optimal Polyline Simplification using the Hausdorff and Fr{\'e}chet Distance},
  journal       = {Computing Research Repository ({CoRR})},
  year          = {2018},
  volume        = {abs/1803.03550},
  archiveprefix = {arXiv},
  bibsource     = {dblp computer science bibliography, https://dblp.org},
  biburl        = {https://dblp.org/rec/bib/journals/corr/abs-1803-03550},
  eprint        = {1803.03550},
  pagetotal     = {17},
  timestamp     = {Tue, 10 Apr 2018 20:50:05 +0200},
  url           = {http://arxiv.org/abs/1803.03550},
}

@Article{vanOosterom2005,
  author    = {van Oosterom, Peter},
  title     = {Variable-scale topological data structures suitable for progressive data transfer: {The} {GAP}-face tree and {GAP}-edge forest},
  journal   = {Cartography and Geographic Information Science},
  year      = {2005},
  volume    = {32},
  number    = {4},
  pages     = {331--346},
  doi       = {10/chr7sf},
  owner     = {Dongliang},
  publisher = {Taylor \& Francis},
  timestamp = {2017.04.28},
  url       = {https://www.tandfonline.com/doi/abs/10.1559/152304005775194782},
}

@InCollection{vanOosterom1995GAPTree,
  author    = {van Oosterom, Peter},
  title     = {The {GAP}-tree, an approach to {On-the-Fly} map generalization of an area partitioning},
  booktitle = {{GIS} and Generalization: {Methodology} and Practice},
  publisher = {Taylor \& Francis},
  year      = {1995},
  editor    = {Mueller, Jean-Claude and Lagrange, Jean-Philippe and Weibel, Robert},
  pages     = {120--132},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{vanOosterom2014Support,
  author    = {van Oosterom, Peter and Martijn Meijers},
  title     = {Vario-scale data structures supporting smooth zoom and progressive transfer of {2D} and {3D} data},
  journal   = {International Journal of Geographical Information Science},
  year      = {2014},
  volume    = {28},
  number    = {3},
  pages     = {455--478},
  doi       = {10.1080/13658816.2013.809724},
  eprint    = {https://doi.org/10.1080/13658816.2013.809724},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1080/13658816.2013.809724},
}

@Article{vanOosterom1995Development,
  author    = {van Oosterom, Peter and Vincent Schenkelaars},
  title     = {The Development of an Interactive Multi-Scale {GIS}},
  journal   = {International Journal of Geographical Information Systems},
  year      = {1995},
  volume    = {9},
  number    = {5},
  pages     = {489--507},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/gis/OosteromS95},
  comment   = {10.1080/02693799508902052},
  doi       = {10/fgzjvb},
  owner     = {Dongliang},
  timestamp = {Mon, 15 Aug 2011 17:18:09 +0200},
  url       = {http://dx.doi.org/10.1080/02693799508902052},
}

@Article{vanOosterom1989,
  author    = {van Oosterom, Peter and van den Bos, Jan},
  title     = {An object-oriented approach to the design of geographic information systems},
  journal   = {Computers \& Graphics},
  year      = {1989},
  volume    = {13},
  number    = {4},
  pages     = {409--418},
  doi       = {10.1016/0097-8493(89)90002-2},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://doi.org/10.1016/0097-8493(89)90002-2},
}

@InCollection{vanOosterom2014tGAPSSC,
  author    = {van Oosterom, Peter and Meijers, Martijn and Stoter, Jantien and {\v{S}}uba, Radan},
  title     = {Data Structures for Continuous Generalisation: {tGAP} and {SSC}},
  booktitle = {Abstracting Geographic Information in a Data Rich World: Methodologies and Applications of Map Generalisation},
  publisher = {Springer},
  year      = {2014},
  editor    = {Burghardt, Dirk and Duch{\^e}ne, C{\'e}cile and Mackaness, William},
  series    = {Lecture Notes in Geoinformation and Cartography},
  chapter   = {4},
  pages     = {83--117},
  address   = {Cham},
  isbn      = {978-3-319-00203-3},
  doi       = {10.1007/978-3-319-00203-3_4},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://link.springer.com/chapter/10.1007/978-3-319-00203-3_4},
}

@PhdThesis{vanSmaalen2003,
  author    = {van Smaalen, J.W.N.},
  title     = {Automated Aggregation of Geographic Objects},
  school    = {Wageningen University},
  year      = {2003},
  type      = {phdthesis},
  address   = {The Netherlands},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Vatti1992Clip,
  author     = {Vatti, Bala R.},
  title      = {A Generic Solution to Polygon Clipping},
  journal    = {Communications of the ACM},
  year       = {1992},
  volume     = {35},
  number     = {7},
  pages      = {56--63},
  issn       = {0001-0782},
  acmid      = {129906},
  address    = {New York, NY, USA},
  comment    = {10.1145/129902.129906, #jul#},
  doi        = {10/ct78wx},
  issue_date = {July 1992},
  keywords   = {connectivity coherence, contributing edge, contributing local minimum, difference, hidden surface, intersection, polygon clipping, scanbeam, spatial coherence, successor edge, trapezoids, unions, vertex classification},
  numpages   = {8},
  owner      = {Dongliang},
  publisher  = {ACM},
  timestamp  = {2017.10.19},
}

@InProceedings{Volz2006,
  author               = {Volz, Steffen},
  title                = {An iterative approach for matching multiple representations of street data},
  booktitle            = {Proc.\ Joint {ISPRS} Workshop on Multiple Representations and Interoperability of Spatial Data},
  year                 = {2006},
  pages                = {101--110},
  address              = {Hannover, Germany},
  citeulike-article-id = {12357012},
  comment              = {https://www.researchgate.net/publication/37685878_An_Iterative_Approach_for_Matching_Multiple_Representations_of_Street_Data},
  keywords             = {data-matching},
  owner                = {Dongliang},
  posted-at            = {2013-05-21 12:36:36},
  timestamp            = {2017.10.14},
}

@Article{Wang2015Change,
  author    = {Xiaomi Wang and Binbin Zhao and Min Deng and Dongliang Peng},
  title     = {Change Classification and Detection of Hydrographic Objects from Maps of Different Scales {(in Chinese)}},
  journal   = {Geography and Geo-Information Science},
  year      = {2015},
  volume    = {31},
  number    = {6},
  pages     = {25--29},
  doi       = {10.3969/j.issn.1672-0504.2015.06.005},
  owner     = {PDL},
  timestamp = {2017.03.12},
}

@InCollection{Weibel1997,
  author    = {Weibel, Robert},
  title     = {Generalization of spatial data: {Principles} and selected algorithms},
  booktitle = {Algorithmic Foundations of Geographic Information Systems},
  publisher = {Springer},
  year      = {1997},
  editor    = {van Kreveld, Marc and Nievergelt, J{\"u}rg and Roos, Thomas and Widmayer, Peter},
  volume    = {1340},
  series    = {Lecture Notes in Computer Science},
  chapter   = {5},
  pages     = {99--152},
  isbn      = {978-3-540-69653-7},
  doi       = {10.1007/3-540-63818-0_5},
  owner     = {Dongliang},
  timestamp = {2017.07.14},
  url       = {https://link.springer.com/content/pdf/10.1007/3-540-63818-0_5.pdf},
}

@InCollection{Weibel2017Fly,
  author    = {Robert Weibel and Dirk Burghardt},
  title     = {Generalization, On-the-Fly},
  booktitle = {Encyclopedia of {GIS}},
  publisher = {Springer},
  year      = {2017},
  editor    = {Shashi Shekhar and Hui Xiong and Xun Zhou},
  pages     = {657--663},
  edition   = {2},
  doi       = {10.1007/978-3-319-17885-1_450},
  owner     = {Dongliang},
  timestamp = {2017.11.03},
  url       = {https://link.springer.com/referenceworkentry/10.1007%2F978-3-319-17885-1_450},
}

@InCollection{Wertheimer38,
  author    = {Wertheimer, M.},
  title     = {Laws of organization in perceptual forms},
  booktitle = {A sourcebook of Gestalt psychology},
  publisher = {Routledge and Kegan Paul},
  year      = {1938},
  editor    = {Ellis, W. D.},
  pages     = {71--88},
  journal   = {Psychologische Forschung},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {https://psychclassics.yorku.ca/Wertheimer/Forms/forms.htm},
}

@Article{Whited2011BallMorph,
  author    = {Brian Whited and Jarek Rossignac},
  title     = {Ball-Morph: {Definition}, implementation, and comparative evaluation},
  journal   = {{IEEE} Transactions on Visualization and Computer Graphics},
  year      = {2011},
  volume    = {17},
  number    = {6},
  pages     = {757--769},
  issn      = {1077-2626},
  doi       = {10.1109/TVCG.2010.115},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@InProceedings{Whited2009,
  author    = {Whited, Brian and Rossignac, Jarek},
  title     = {B-morphs between b-compatible curves in the plane},
  booktitle = {Proc.\ 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling},
  year      = {2009},
  editor    = {Bronsvoort, Willem F. and Gonsor, Daniel and Regli, William C. and Grandine, Thomas A. and Vandenbrande, Jan H. and Gravesen, Jens and Keyser, John},
  number    = {12},
  pages     = {187--198},
  address   = {San Francisco, California},
  publisher = {ACM},
  doi       = {10.1145/1629255.1629279},
  isbn      = {978-1-60558-711-0},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
}

@Article{Williams2002Contiguous,
  author    = {Williams, Justin C.},
  title     = {A Zero-One Programming Model for Contiguous Land Acquisition},
  journal   = {Geographical Analysis},
  year      = {2002},
  volume    = {34},
  number    = {4},
  pages     = {330--349},
  issn      = {1538-4632},
  doi       = {10.1111/j.1538-4632.2002.tb01093.x},
  owner     = {Dongliang},
  publisher = {Blackwell Publishing Ltd},
  timestamp = {2017.11.22},
}

@Book{Williams2009Integer,
  title     = {Logic and Integer Programming},
  publisher = {Springer},
  year      = {2009},
  author    = {Williams, H. Paul},
  edition   = {1},
  doi       = {10.1007/978-0-387-92280-5},
  url       = {https://www.springer.com/gp/book/9780387922799},
}

@Article{Wright1983,
  author    = {Jeffrey Wright and Charles Revelle and Jared Cohon},
  title     = {A multiobjective integer programming model for the land acquisition problem},
  journal   = {Regional Science and Urban Economics},
  year      = {1983},
  volume    = {13},
  number    = {1},
  pages     = {31--53},
  issn      = {0166-0462},
  comment   = {10.1016/0166-0462(83)90004-2},
  doi       = {10/dqgvs5},
  owner     = {Dongliang},
  timestamp = {2017.10.05},
  url       = {http://www.sciencedirect.com/science/article/pii/0166046283900042},
}

@Article{Wu2004DP,
  author    = {Wu, Shin-Ting AND da Silva, Adler C. G. AND M{\'a}rquez, Mercedes R. G.},
  title     = {The {Douglas}--{Peucker} algorithm: {Sufficiency} conditions for non-self-intersections},
  journal   = {Journal of the Brazilian Computer Society},
  year      = {2004},
  volume    = {9},
  number    = {3},
  pages     = {67--84},
  month     = {04},
  issn      = {0104-6500},
  comment   = {http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002004000100006&lng=en&nrm=iso&tlng=en},
  doi       = {10/cxwv},
  language  = {en},
  publisher = {{SciELO}},
  url       = {http://doi.org/cxwv},
}

@Article{Xia2013,
  author    = {Ge Xia},
  journal   = {SIAM Journal on Computing},
  title     = {The Stretch Factor of the Delaunay Triangulation Is Less than 1.998},
  year      = {2013},
  number    = {4},
  pages     = {1620--1659},
  volume    = {42},
  doi       = {10.1137/110832458},
  eprint    = {https://doi.org/10.1137/110832458},
  owner     = {Dongliang},
  timestamp = {2017.10.17},
  url       = {https://doi.org/10.1137/110832458},
}

@Article{Young1988,
  author    = {H. P. Young},
  title     = {Measuring the Compactness of Legislative Districts},
  journal   = {Legislative Studies Quarterly},
  year      = {1988},
  volume    = {13},
  number    = {1},
  pages     = {105--115},
  doi       = {10.2307/439947},
  owner     = {Dongliang},
  timestamp = {2017.10.05},
  url       = {https://www.jstor.org/stable/439947},
}

@Article{Zeng2009,
  author    = {W. Zeng and R. L. Church},
  title     = {Finding shortest paths on real road networks: the case for {A*}},
  journal   = {International Journal of Geographical Information Science},
  year      = {2009},
  volume    = {23},
  number    = {4},
  pages     = {531--543},
  doi       = {10.1080/13658810801949850},
  eprint    = {http://dx.doi.org/10.1080/13658810801949850},
  owner     = {Dongliang},
  timestamp = {2017.04.28},
  url       = {http://dx.doi.org/10.1080/13658810801949850},
}

@Article{Zhang2008Matching,
  author    = {Meng Zhang and Liqiu Meng},
  title     = {Delimited Stroke Oriented Algorithm-Working Principle and Implementation for the Matching of Road Networks},
  journal   = {Geographic Information Sciences},
  year      = {2008},
  volume    = {14},
  number    = {1},
  pages     = {44--53},
  comment   = {10/drcg44},
  doi       = {10.1080/10824000809480638},
  eprint    = {http://dx.doi.org/10.1080/10824000809480638},
  owner     = {Dongliang},
  publisher = {Taylor \& Francis},
  timestamp = {2017.10.16},
  url       = {http://dx.doi.org/10.1080/10824000809480638},
}

@Article{Zhang2013,
  author    = {Zhang, Liqiang and Deng, Hao and Chen, Dong and Wang, Zhen},
  title     = {A spatial cognition-based urban building clustering approach and its applications},
  journal   = {International Journal of Geographical Information Science},
  year      = {2013},
  volume    = {27},
  number    = {4},
  pages     = {721--740},
  doi       = {10.1080/13658816.2012.700518},
  eprint    = {http://dx.doi.org/10.1080/13658816.2012.700518},
  owner     = {Dongliang},
  timestamp = {2017.05.17},
}

@Article{Zhang2013Recognition,
  author   = {Zhang, Xiang and Ai, Tinghua and Stoter, Jantien and Kraak, Menno-Jan and Molenaar, Martien},
  journal  = {GeoInformatica},
  title    = {Building pattern recognition in topographic data: {Examples} on collinear and curvilinear alignments},
  year     = {2013},
  issn     = {1573-7624},
  month    = {Jan},
  number   = {1},
  pages    = {1--33},
  volume   = {17},
  abstract = {Building patterns are important features that should be preserved in the map generalization process. However, the patterns are not explicitly accessible to automated systems. This paper proposes a framework and several algorithms that automatically recognize building patterns from topographic data, with a focus on collinear and curvilinear alignments. For both patterns two algorithms are developed, which are able to recognize alignment-of-center and alignment-of-side patterns. The presented approach integrates aspects of computational geometry, graph-theoretic concepts and theories of visual perception. Although the individual algorithms for collinear and curvilinear patterns show great potential for each type of the patterns, the recognized patterns are neither complete nor of enough good quality. We therefore advocate the use of a multi-algorithm paradigm, where a mechanism is proposed to combine results from different algorithms to improve the recognition quality. The potential of our method is demonstrated by an application of the framework to several real topographic datasets. The quality of the recognition results are validated in an expert survey.},
  day      = {01},
  doi      = {10.1007/s10707-011-0146-3},
  url      = {https://doi.org/10.1007/s10707-011-0146-3},
}

@Article{Zhao2016Inconsistencies,
  author    = {Zhao, Binbin and Deng, Min and Peng, Dongliang and Zhu, Jianjun},
  title     = {A Methodology of Handling Inconsistencies Between Line Objects in Multi-scale Maps Based on the Optimum Correspondence Algorithm {(in Chinese)}},
  journal   = {Geomatics and Information Science of Wuhan University},
  year      = {2016},
  volume    = {41},
  number    = {8},
  pages     = {1046--1054},
  doi       = {10.13203/j.whugis20140430},
  owner     = {PDL},
  timestamp = {2017.03.12},
}

@Article{Zhao2016Assimilation,
  author    = {Zhao, Binbin and Peng, Dongliang and Zhang, Shanshan and Liu, Shanshan and Xiong, Xuping and Dai, Quanfa},
  title     = {An Assimilation Method of Inconsistency Between Area Objects at Different Scales with Respect to Spatial Relation Constraints {(in Chinese)}},
  journal   = {Geomatics and Information Science of Wuhan University},
  year      = {2016},
  volume    = {41},
  number    = {7},
  pages     = {911--917},
  doi       = {10.13203/j.whugis20140011},
  owner     = {PDL},
  timestamp = {2017.03.12},
  url       = {http://ch.whu.edu.cn/CN/Y2016/V41/I7/911},
}

@Article{Zhao2010,
  author    = {Ling Zhao and Min Deng and Jiaqiu Wang and Dongliang Peng},
  title     = {Structural Property Analysis of Urban Street Networks Based on Complex Network Theory {(in Chinese)}},
  journal   = {Geography and Geo-Information Science},
  year      = {2010},
  volume    = {26},
  number    = {5},
  pages     = {11--15},
  owner     = {Dongliang},
  timestamp = {2017.04.08},
}

@Article{Zoltners1983Territory,
  author    = {Andris A. Zoltners and Prabhakant Sinha},
  title     = {Sales Territory Alignment: A Review and Model},
  journal   = {Management Science},
  year      = {1983},
  volume    = {29},
  number    = {11},
  pages     = {1237--1256},
  abstract  = {The sales territory alignment problem may be viewed as the problem of grouping small geographic sales coverage units into larger geographic clusters called sales territories in a way that the sales territories are acceptable according to managerially relevant alignment criteria. This paper first reviews sales territory alignment models which have appeared in the marketing literature. A framework for sales territory alignment and several properties of a good sales territory alignment are developed in the course of the review. A general sales territory alignment model which accommodates these properties is developed. A solution procedure for the general model is presented. Finally, an actual implementation of the general model is described. The implementation provides a comparison of the general model with a similar model which has been frequently cited in the marketing literature.},
  doi       = {10.1287/mnsc.29.11.1237},
  owner     = {Dongliang},
  timestamp = {2017.11.22},
  url       = {https://doi.org/10.1287/mnsc.29.11.1237},
}

@InProceedings{vanPutten1998NewGAP,
  author    = {van Putten, Judith and van Oosterom, Peter},
  booktitle = {Proc.\ 8th International Symposium on Spatial Data Handling {(SDH)}},
  title     = {New results with Generalized Area Partitionings},
  year      = {1998},
  address   = {Vancouver, Canada},
  month     = jul,
  pages     = {485--495},
  comment   = {12-15 July},
  owner     = {Dongliang},
  timestamp = {2017.05.17},
  url       = {www.gdmc.nl/oosterom/sdh98.pdf},
}

@Article{Li2018Fourier,
  author    = {Li, Jingzhong AND Liu, Pengcheng AND Yu, Wenhao AND Cheng, Xiaoqiang},
  journal   = {PLOS ONE},
  title     = {The morphing of geographical features by Fourier transformation},
  year      = {2018},
  month     = {01},
  number    = {1},
  pages     = {1--13},
  volume    = {13},
  abstract  = {This paper presents a morphing model of vector geographical data based on Fourier transformation. This model involves three main steps. They are conversion from vector data to Fourier series, generation of intermediate function by combination of the two Fourier series concerning a large scale and a small scale, and reverse conversion from combination function to vector data. By mirror processing, the model can also be used for morphing of linear features. Experimental results show that this method is sensitive to scale variations and it can be used for vector map features¡¯ continuous scale transformation. The efficiency of this model is linearly related to the point number of shape boundary and the interceptive value n of Fourier expansion. The effect of morphing by Fourier transformation is plausible and the efficiency of the algorithm is acceptable.},
  doi       = {10.1371/journal.pone.0191136},
  publisher = {Public Library of Science},
  url       = {https://doi.org/10.1371/journal.pone.0191136},
}

@Article{Shen2019Aggregation,
  author   = {Yilang Shen and Tinghua Ai and Wende Li and Min Yang and Yu Feng},
  journal  = {Computers, Environment and Urban Systems},
  title    = {A polygon aggregation method with global feature preservation using superpixel segmentation},
  year     = {2019},
  issn     = {0198-9715},
  pages    = {117--131},
  volume   = {75},
  doi      = {10.1016/j.compenvurbsys.2019.01.009},
  keywords = {Polygon aggregation, Map generalization, Superpixel segmentation},
  url      = {http://www.sciencedirect.com/science/article/pii/S0198971518305106},
}

@InProceedings{Ware1995Areal,
  author    = {Ware, J. Mark and Jones, Christopher B. and Bundy, Geraint Ll.},
  booktitle = {Spatial Information Theory A Theoretical Basis for GIS},
  title     = {A triangulated spatial model for cartographic generalisation of areal objects},
  year      = {1995},
  address   = {Berlin, Heidelberg},
  editor    = {Frank, Andrew U. and Kuhn, Werner},
  pages     = {173--192},
  publisher = {Springer Berlin Heidelberg},
  abstract  = {Cartographic generalisation involves interaction between individual operators concerned with processes such as object elimination, detail reductions amalgamation, typification and displacement. Effective automation of these processes requires a means of maintaining knowledge of the spatial relationships between map objects in order to ensure that constraints of topology and of proximity are obeyed in the course of the individual generalisation transformations. Triangulated spatial models, based on the constrained Delaunay triangulation, have proven to be of particular value in representing the proximal and topological relations between map objects and hence in performing many of the essential tasks of fully automated cartographic generalisation. These include the identification of nearby objects; determination of the structure of space between nearby objects; execution of boundary simplification, merge and collapse operations; and the detection and resolution, by displacement, of topological inconsistencies arising from individual operators. In this paper we focus on the use of a triangulated model for operations specific to execution of merge operations between areal objects. The model is exploited to identify the regions of space between nearby objects and to execute merge operations in which the triangulation is used variously to adopt intervening space and to move adjacent rectangular objects to touch each other. Methods for updating the triangulation are described.},
  isbn      = {978-3-540-45519-6},
}

@Article{Su1997aggregation,
  author    = {Bo Su and Zhilin Li and Graham Lodwick and Jean-Claude Muller},
  journal   = {International Journal of Geographical Information Science},
  title     = {Algebraic models for the aggregation of area features based upon morphological operators},
  year      = {1997},
  number    = {3},
  pages     = {233--246},
  volume    = {11},
  doi       = {10.1080/136588197242374},
  eprint    = {https://doi.org/10.1080/136588197242374},
  publisher = {Taylor & Francis},
  url       = {https://doi.org/10.1080/136588197242374},
}

@InProceedings{Regnauld2003Amalgamation,
  author    = {Nicolas Regnauld},
  booktitle = {Proc.\ 21st International Cartographic Conference},
  title     = {Algorithms for the amalgamation of topographic data},
  year      = {2003},
  address   = {Durban, South Africa},
  month     = aug,
  pages     = {222--234},
  comment   = {10--16 August},
}

@Article{Achanta2012SLIC,
  author  = {Radhakrishna Achanta and Appu Shaji and Kevin Smith and Aurelien Lucchi and Pascal Fua and Sabine S\"usstrunk},
  journal = {{IEEE} Transactions on Pattern Analysis and Machine Intelligence},
  title   = {{SLIC} Superpixels Compared to State-of-the-Art Superpixel Methods},
  year    = {2012},
  number  = {11},
  pages   = {2274--2282},
  volume  = {34},
  doi     = {10.1109/TPAMI.2012.120},
  url     = {https://ieeexplore.ieee.org/document/6205760},
}

@Article{He2018Amalgamation,
  author         = {He, Xianjin and Zhang, Xinchang and Yang, Jie},
  journal        = {{ISPRS} International Journal of Geo-Information},
  title          = {Progressive Amalgamation of Building Clusters for Map Generalization Based on Scaling Subgroups},
  year           = {2018},
  issn           = {2220-9964},
  number         = {3},
  volume         = {7},
  article-number = {116},
  doi            = {10.3390/ijgi7030116},
  pagetotal      = {16},
  url            = {https://www.mdpi.com/2220-9964/7/3/116},
}

@Article{Regnauld2007Amalgamation,
  author    = {Nicolas Regnauld and Patrick Revell},
  journal   = {The Cartographic Journal},
  title     = {Automatic Amalgamation of Buildings for Producing Ordnance Survey $1:50\,000$ Scale Maps},
  year      = {2007},
  number    = {3},
  pages     = {239--250},
  volume    = {44},
  comment   = {#aug#},
  doi       = {10.1179/000870407X241782},
  publisher = {Taylor \& Francis},
  url       = {https://doi.org/10.1179/000870407X241782},
}

@InCollection{Ai2007Aggregation,
  author    = {Ai, Tinghua and Zhang, Xiang},
  title     = {The Aggregation of Urban Building Clusters Based on the Skeleton Partitioning of Gap Space},
  booktitle = {The European Information Society: Leading the Way with Geo-information},
  publisher = {Springer Berlin Heidelberg},
  year      = {2007},
  editor    = {Fabrikant, Sara Irina and Wachowicz, Monica},
  series    = {Lecture Notes in Geoinformation and Cartography},
  pages     = {153--170},
  address   = {Berlin, Heidelberg},
  isbn      = {978-3-540-72385-1},
  doi       = {10.1007/978-3-540-72385-1_9},
  url       = {https://doi.org/10.1007/978-3-540-72385-1_9},
}

@Article{Ai2015Building,
  author    = {Tinghua Ai and Xiang Zhang and Qi Zhou and Min Yang},
  journal   = {International Journal of Geographical Information Science},
  title     = {A vector field model to handle the displacement of multiple conflicts in building generalization},
  year      = {2015},
  number    = {8},
  pages     = {1310--1331},
  volume    = {29},
  doi       = {10.1080/13658816.2015.1019886},
  publisher = {Taylor \& Francis},
}

@Book{Read2000Film,
  author    = {Paul Read and Mark-Paul Meyer},
  publisher = {Elsevier},
  title     = {Restoration of Motion Picture Film},
  year      = {2000},
  month     = aug,
  url       = {https://www.elsevier.com/books/restoration-of-motion-picture-film/read/978-0-08-051619-6},
}

@Book{Ghayour2018WebGL,
  title     = {Real-Time 3D Graphics with WebGL 2: Build Interactive 3D Applications with JavaScript and WebGL 2 (OpenGL ES 3.0)},
  publisher = {Packt Publishing},
  year      = {2018},
  author    = {Ghayour, Farhad and Cantor, Diego},
  edition   = {2},
  isbn      = {1788629698},
}

@Book{Matsuda2013WebGL,
  author    = {Kouichi Matsuda and Rodger Lea},
  publisher = {Addison Wesley Publishing Company},
  title     = {WebGL programming guide: Interactive 3D graphics programming with WebGL},
  year      = {2013},
  isbn      = {978-0-321-90292-4},
  month     = jun,
  series    = {OpenGL series},
  day       = {9},
  language  = {English},
}

@Article{Veenendaal2017Review,
  author    = {Bert Veenendaal and Maria Antonia Brovelli and Songnian Li},
  title     = {Review of Web Mapping: Eras, Trends and Directions},
  journal   = {{ISPRS} International Journal of Geo-Information},
  year      = {2017},
  volume    = {6},
  number    = {10},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/journals/ijgi/VeenendaalBL17.bib},
  doi       = {10.3390/ijgi6100317},
  paper     = {317},
  timestamp = {Tue, 14 Aug 2018 12:19:21 +0200},
  url       = {https://doi.org/10.3390/ijgi6100317},
}

@InProceedings{Ai2002GAP,
  author    = {Ai, Tinghua and van Oosterom, Peter},
  booktitle = {Proc.\ 10th International Symposium on Spatial Data Handling ({SDH})},
  title     = {{GAP}-Tree Extensions Based on Skeletons},
  year      = {2002},
  address   = {Ottawa, Canada},
  editor    = {Richardson, Dianne E. and van Oosterom, Peter},
  month     = jul,
  pages     = {501--513},
  publisher = {Springer Berlin Heidelberg},
  comment   = {July 9-12, 2002},
  doi       = {10.1007/978-3-642-56094-1_37},
  isbn      = {978-3-642-56094-1},
  url       = {https://link.springer.com/chapter/10.1007/978-3-642-56094-1_37},
}

@Article{Peng2020AreaAgg,
  author    = {Peng, Dongliang and Wolff, Alexander and Haunert, Jan-Henrik},
  journal   = {ACM Transactions on Spatial Algorithms and Systems},
  title     = {Finding Optimal Sequences for Area Aggregation---{A}{$^{\!\star}$\xspace} vs.\ Integer Linear Programming},
  year      = {2020},
  month     = oct,
  issue_date = {October 2020},
  publisher = {Association for Computing Machinery},
  address = {New York, NY, USA},
  volume = {7},
  number = {1},
  pages = {1--40},
  issn = {2374-0353},
  url = {https://doi.org/10.1145/3409290},
  comment   = {must do \usepackage{xspace} because we use \xspace in the title.},
  doi       = {10.1145/3409290},
  owner     = {Dongliang},
  timestamp = {2017.05.17},
  articleno = {4},
  numpages = {40},
}

@Article{Gedicke2021Aggregating,
  author    = {Sven Gedicke and Johannes Oehrlein and Jan-Henrik Haunert},
  journal   = {Cartography and Geographic Information Science},
  title     = {Aggregating land-use polygons considering line features as separating map elements},
  year      = {2021},
  number    = {2},
  pages     = {124--139},
  volume    = {48},
  doi       = {10.1080/15230406.2020.1851613},
  publisher = {Taylor \& Francis},
}

@Comment{jabref-meta: databaseType:bibtex;}