{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:12:46Z","timestamp":1749615166154,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319457376"},{"type":"electronic","value":"9783319457383"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45738-3_2","type":"book-chapter","created":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T11:49:06Z","timestamp":1473767346000},"page":"18-33","source":"Crossref","is-referenced-by-count":4,"title":["Partitioning Polygons via Graph Augmentation"],"prefix":"10.1007","author":[{"given":"Jan-Henrik","family":"Haunert","sequence":"first","affiliation":[]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,14]]},"reference":[{"key":"2_CR1","first-page":"3","volume":"3","author":"B Aronov","year":"2011","unstructured":"Aronov, B., Buchin, K., Buchin, M., Jansen, B., de Jong, T., van Kreveld, M., L\u00f6ffler, M., Luo, J., Silveira, R.I., Speckmann, B.: Connect the dot: computing feed-links for network extension. J. Spat. Inf. Sci. 3, 3\u201331 (2011)","journal-title":"J. Spat. Inf. Sci."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.comgeo.2007.07.004","volume":"40","author":"B Aronov","year":"2008","unstructured":"Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Smid, M., Vigneron, A.: Sparse geometric graphs with small dilation. Comput. Geom. 40, 207\u2013219 (2008)","journal-title":"Comput. Geom."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., Keil, J.: On the stretch factor of the constrained Delaunay triangulation. In: Proceedings 3rd International Symposium on Voronoi Diagrams in Science and Engineering, pp. 25\u201331 (2006)","DOI":"10.1109\/ISVD.2006.28"},{"issue":"7","key":"2_CR4","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"47","author":"P Bose","year":"2013","unstructured":"Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 47(7), 818\u2013830 (2013)","journal-title":"Comput. Geom."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Dobkin, D.: Decomposing a polygon into its convex parts. In: Proceedings of the 11th Annual ACM Symposium on Theory of Computing, pp. 38\u201348 (1979)","DOI":"10.1145\/800135.804396"},{"issue":"1\u20134","key":"2_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"LP Chew","year":"1989","unstructured":"Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4(1\u20134), 97\u2013108 (1989)","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR7","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/050635675","volume":"38","author":"M Farshi","year":"2008","unstructured":"Farshi, M., Giannopoulos, P., Gudmundsson, J.: Improving the stretch factor of a geometric network by edge augmentation. SIAM J. Comput. 38(1), 226\u2013240 (2008)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"2_CR8","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1109\/T-C.1975.224276","volume":"24","author":"HYF Feng","year":"1975","unstructured":"Feng, H.Y.F., Pavlidis, T.: Decomposition of polygons into simpler components: feature generation for syntactic pattern recognition. IEEE Trans. Comput. 24(6), 636\u2013650 (1975)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"2_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1142\/S0218195910003244","volume":"20","author":"P Giannopoulos","year":"2010","unstructured":"Giannopoulos, P., Klein, R., Knauer, C., Kutz, M., Marx, D.: Computing geometric minimum-dilation graphs is NP-hard. Int. J. Comput. Geom. Appl. 20(2), 147\u2013173 (2010)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"2_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1019765902987","volume":"6","author":"L Harrie","year":"2002","unstructured":"Harrie, L., Sarjakoski, T.: Simultaneous graphic generalization of vector data sets. GeoInformatica 6(3), 233\u2013261 (2002)","journal-title":"GeoInformatica"},{"issue":"12","key":"2_CR11","doi-asserted-by":"crossref","first-page":"2555","DOI":"10.1109\/TVCG.2011.191","volume":"17","author":"J-H Haunert","year":"2011","unstructured":"Haunert, J.-H., Sering, L.: Drawing road networks with focus regions. IEEE Trans. Vis. Comput. Graph. 17(12), 2555\u20132562 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"12","key":"2_CR12","doi-asserted-by":"crossref","first-page":"1871","DOI":"10.1080\/13658810903401008","volume":"24","author":"J-H Haunert","year":"2010","unstructured":"Haunert, J.-H., Wolff, A.: Area aggregation in map generalisation by mixed-integer programming. Int. J. Geogr. Inf. Sci. 24(12), 1871\u20131897 (2010)","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"3","key":"2_CR13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1142\/S0218195902000803","volume":"12","author":"JM Keil","year":"2002","unstructured":"Keil, J.M., Snoeyink, J.: On the time bound for convex decomposition of simple polygons. Int. J. Comput. Geom. Appl. 12(3), 181\u2013192 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.comgeo.2005.06.004","volume":"34","author":"R Klein","year":"2006","unstructured":"Klein, R., Levcopoulos, C., Lingas, A.: A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. Comput. Geom. 34, 28\u201334 (2006)","journal-title":"Comput. Geom."},{"issue":"1","key":"2_CR15","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.comgeo.2005.10.005","volume":"35","author":"J-M Lien","year":"2006","unstructured":"Lien, J.-M., Amato, N.M.: Approximate convex decomposition of polygons. Comput. Geom. Theory Appl. 35(1), 100\u2013123 (2006)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BFb0012784","volume-title":"Automata, Languages and Programming","author":"A Lingas","year":"1982","unstructured":"Lingas, A.: The power of non-rectilinear holes. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages and Programming. LNCS, vol. 140, pp. 369\u2013383. Springer, Heidelberg (1982)"},{"issue":"3","key":"2_CR17","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/34.368189","volume":"17","author":"K Siddiqi","year":"1995","unstructured":"Siddiqi, K., Kimia, B.B.: Parts of visual form: computational aspects. IEEE Trans. Pattern Anal. Mach. Intell. 17(3), 239\u2013251 (1995)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"van Dijk, T.C., van Goethem, A., Haunert, J.-H., Meulemans, W., Speckmann, B.: Accentuating focus maps via partial schematization. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 418\u2013421 (2013)","DOI":"10.1145\/2525314.2525452"},{"key":"2_CR19","volume-title":"With Application to GIS","author":"A Voisard","year":"2002","unstructured":"Voisard, A., Scholl, M.O., Rigaux, P., Databases, S.: With Application to GIS. Morgan Kaufmann, Burlington (2002)"},{"issue":"2","key":"2_CR20","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.comgeo.2009.03.008","volume":"43","author":"C Wulff-Nilsen","year":"2010","unstructured":"Wulff-Nilsen, C.: Computing the dilation of edge-augmented graphs in metric spaces. Comput. Geom. 43(2), 68\u201372 (2010)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Geographic Information Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45738-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T18:27:01Z","timestamp":1749580021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45738-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319457376","9783319457383"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45738-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}