{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:09Z","timestamp":1725558429824},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_27","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T07:00:50Z","timestamp":1276153250000},"page":"285-296","source":"Crossref","is-referenced-by-count":11,"title":["Path Schematization for Route Sketches"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Gemsa","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","first-page":"241","volume-title":"SIGGRAPH","author":"M. Agrawala","year":"2001","unstructured":"Agrawala, M., Stolte, C.: Rendering effective route maps: Improving usability through generalization. In: Fiume, E. (ed.) SIGGRAPH, pp. 241\u2013249. ACM Press, New York (2001)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-00219-9_25","volume-title":"Graph Drawing","author":"U. Brandes","year":"2009","unstructured":"Brandes, U., Pampel, B.: On the hardness of orthogonal-order preserving graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 266\u2013277. Springer, Heidelberg (2009)"},{"key":"27_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Delling, D., Gemsa, A., N\u00f6llenburg, M., Pajor, T.: Path Schematization for Route Sketches. Technical Report 2010-02, Karlsruhe Institute of Technology (2010)","DOI":"10.1007\/978-3-642-13731-0_27"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11618058_14","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: Stress majorization with orthogonal ordering constraints. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 141\u2013152. Springer, Heidelberg (2006)"},{"key":"27_CR6","first-page":"302","volume-title":"STOC\u201984","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: STOC\u201984, pp. 302\u2013311. ACM, New York (1984)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-70904-6_26","volume-title":"Graph Drawing","author":"D. Merrick","year":"2007","unstructured":"Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 258\u2013269. Springer, Heidelberg (2007)"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Visual Languages and Computing\u00a06(2), 183\u2013210 (1995)","journal-title":"J. Visual Languages and Computing"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48447-7_2","volume-title":"Algorithms and Data Structures","author":"G. Neyer","year":"1999","unstructured":"Neyer, G.: Line simplification with restricted orientations. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 13\u201324. Springer, Heidelberg (1999)"},{"key":"27_CR10","unstructured":"Ovenden, M.: Metro Maps of the World. Capital Transport Publishing (2003)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-57207-4_2","volume-title":"Spatial Information Theory","author":"B. Tversky","year":"1993","unstructured":"Tversky, B.: Cognitive maps, cognitive collages, and spatial mental models. In: Campari, I., Frank, A.U. (eds.) COSIT 1993. LNCS, vol.\u00a0716, pp. 14\u201324. Springer, Heidelberg (1993)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-48384-5_4","volume-title":"Spatial Information Theory. Cognitive and Computational Foundations of Geographic Information Science","author":"B. Tversky","year":"1999","unstructured":"Tversky, B., Lee, P.U.: Pictorial and verbal tools for conveying routes. In: Freksa, C., Mark, D.M. (eds.) COSIT 1999. LNCS, vol.\u00a01661, pp. 51\u201364. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:42:22Z","timestamp":1606167742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}