{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:05:46Z","timestamp":1740096346880,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_40","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"463-474","source":"Crossref","is-referenced-by-count":6,"title":["Two-Sided Boundary Labeling with Adjacent Sides"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Kindermann","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Niedermann","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"40_CR1","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput.\u00a029(3), 912\u2013953 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/s00453-009-9283-6","volume":"57","author":"M.A. Bekos","year":"2010","unstructured":"Bekos, M.A., Kaufmann, M., N\u00f6llenburg, M., Symvonis, A.: Boundary labeling with octilinear leaders. Algorithmica\u00a057(3), 436\u2013461 (2010)","journal-title":"Algorithmica"},{"issue":"6","key":"40_CR3","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1093\/comjnl\/bxp087","volume":"53","author":"M.A. Bekos","year":"2010","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Area-feature boundary labeling. Comput. J.\u00a053(6), 827\u2013841 (2010)","journal-title":"Comput. J."},{"issue":"3","key":"40_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.comgeo.2006.05.003","volume":"36","author":"M.A. Bekos","year":"2007","unstructured":"Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. Theory Appl.\u00a036(3), 215\u2013236 (2007), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.comgeo.2006.05.003","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"40_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.7155\/jgaa.00189","volume":"13","author":"M. Benkert","year":"2009","unstructured":"Benkert, M., Haverkort, H.J., Kroll, M., N\u00f6llenburg, M.: Algorithms for multi-criteria boundary labeling. J. Graph. Algorithms Appl.\u00a013(3), 289\u2013317 (2009)","journal-title":"J. Graph. Algorithms Appl."},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1090\/conm\/223\/22","volume-title":"Advances in Discrete and Computational Geometry","author":"B. Chazelle","year":"1999","unstructured":"Chazelle, B.: 36 co-authors: The computational geometry impact task force report. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, vol.\u00a0223, pp. 407\u2013463. American Mathematical Society, Providence (1999)"},{"issue":"12","key":"40_CR7","doi-asserted-by":"publisher","first-page":"2583","DOI":"10.1109\/TVCG.2012.193","volume":"18","author":"M. Fink","year":"2012","unstructured":"Fink, M., Haunert, J.H., Schulz, A., Spoerhase, J., Wolff, A.: Algorithms for labeling focus regions. IEEE Trans. Visual. Comput. Graphics\u00a018(12), 2583\u20132592 (2012), \n                  \n                    http:\/\/dx.doi.org\/10.1109\/TVCG.2012.193","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"key":"40_CR8","unstructured":"Freeman, H., Marrinan, S., Chitalia, H.: Automated labeling of soil survey maps. In: ASPRS-ACSM Annual Convention, Baltimore, vol.\u00a01, pp. 51\u201359 (1996)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Gemsa, A., Haunert, J.H., N\u00f6llenburg, M.: Boundary-labeling algorithms for panorama images. In: 19th ACM SIGSPATIAL Int. Conf. Adv. Geogr. Inform. Syst., pp. 289\u2013298 (2011)","DOI":"10.1145\/2093973.2094012"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified positions. Amer. Math. Mon.\u00a098, 165\u2013166 (1991)","journal-title":"Amer. Math. Mon."},{"issue":"6","key":"40_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Comm. ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Comm. ACM"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-11805-0_21","volume-title":"Graph Drawing","author":"B. Katz","year":"2010","unstructured":"Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-geodesic embedding of planar graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 207\u2013218. Springer, Heidelberg (2010)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-sided boundary labeling with adjacent sides. Arxiv report (May 2013), \n                  \n                    http:\/\/arxiv.org\/abs\/1305.0750","DOI":"10.1007\/978-3-642-40104-6_40"},{"key":"40_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0925-7721(99)00005-X","volume":"13","author":"M. Kreveld van","year":"1999","unstructured":"van Kreveld, M., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom. Theory Appl.\u00a013, 21\u201347 (1999), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/S0925-77219900005-X","journal-title":"Comput. Geom. Theory Appl."},{"key":"40_CR15","unstructured":"Morrison, J.L.: Computer technology and cartographic change. In: Taylor, D. (ed.) The Computer in Contemporary Cartography. Johns Hopkins University Press (1980)"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"N\u00f6llenburg, M., Polishchuk, V., Sysikaski, M.: Dynamic one-sided boundary labeling. In: 18th ACM SIGSPATIAL Int. Symp. Adv. Geogr. Inform. Syst., pp. 310\u2013319 (2010)","DOI":"10.1145\/1869790.1869834"},{"issue":"2","key":"40_CR17","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/0196-6774(86)90006-4","volume":"7","author":"R. Raghavan","year":"1986","unstructured":"Raghavan, R., Cohoon, J., Sahni, S.: Single bend wiring. J. Algorithms\u00a07(2), 232\u2013257 (1986)","journal-title":"J. Algorithms"},{"key":"40_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-642-12200-2_41","volume-title":"LATIN 2010: Theoretical Informatics","author":"B. Speckmann","year":"2010","unstructured":"Speckmann, B., Verbeek, K.: Homotopic rectilinear routing with few links and thick edges. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 468\u2013479. Springer, Heidelberg (2010)"},{"issue":"4","key":"40_CR19","first-page":"228","volume":"24","author":"S. Zoraster","year":"1997","unstructured":"Zoraster, S.: Practical results using simulated annealing for point feature label placement. Cartography and GIS\u00a024(4), 228\u2013238 (1997)","journal-title":"Cartography and GIS"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:24:36Z","timestamp":1557930276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}