{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T14:35:31Z","timestamp":1778855731896,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540896456","type":"print"},{"value":"9783540896463","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89646-3_3","type":"book-chapter","created":{"date-parts":[[2008,12,2]],"date-time":"2008-12-02T09:39:28Z","timestamp":1228210768000},"page":"22-30","source":"Crossref","is-referenced-by-count":7,"title":["A Fast and Simple Heuristic for Metro Map Path Simplification"],"prefix":"10.1007","author":[{"given":"Tim","family":"Dwyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Hurst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Merrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","first-page":"482","volume-title":"Graph Drawing","author":"S.H. Hong","year":"2004","unstructured":"Hong, S.H., Merrick, D., do Nascimento, H.A.D.: The metro map layout problem. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 482\u2013491. Springer, Heidelberg (2004)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11618058_29","volume-title":"Graph Drawing","author":"M. N\u00f6llenburg","year":"2006","unstructured":"N\u00f6llenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 321\u2013333. Springer, Heidelberg (2006)"},{"key":"3_CR3","first-page":"355","volume-title":"Proceedings of the 8th International Conference on Information Visualisation (IV 2004)","author":"J. Stott","year":"2004","unstructured":"Stott, J., Rodgers, P.: Metro map layout using multicriteria optimization. In: Proceedings of the 8th International Conference on Information Visualisation (IV 2004), pp. 355\u2013362. IEEE Computer Society, Los Alamitos (2004)"},{"key":"3_CR4","first-page":"388","volume-title":"Proceedings of the 5th International Conference on Knowledge Management","author":"R. Burkhard","year":"2005","unstructured":"Burkhard, R., Meier, M., Rodgers, P., Smis, M., Stott, J.: Knowledge visualization: a comparative study between project tube maps and gantt charts. In: Tochtermann, K., Maurer, H. (eds.) Proceedings of the 5th International Conference on Knowledge Management, pp. 388\u2013395. Know-Center, Austria (2005)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Hahn, W.C., Weinberg, R.A.: A subway map of cancer pathways. Nature Reviews Cancer\u00a02 (2002)","DOI":"10.1038\/nrc795"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Nesbitt, K.V.: Getting to more abstract places using the metro map metaphor. In: Proceedings of the 8th International Conference on Information Visualisation, pp. 488\u2013493 (2004)","DOI":"10.1109\/IV.2004.1320189"},{"key":"3_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., Gudmunsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 258\u2013269. Springer, Heidelberg (2007)"},{"key":"3_CR8","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":"3_CR9","doi-asserted-by":"crossref","unstructured":"Neyer, G.: Line simplification with restricted orientations. In: Proceedings of the 6th International Workshop on Algorithms and Data Structures, pp. 13\u201324 (1999)","DOI":"10.1007\/3-540-48447-7_2"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the fr\u00e9chet distance between two polygonal curves. International Journal of Computational Geometry and Applications\u00a05, 75\u201391 (1995)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"3_CR11","volume-title":"Data Structures and Algorithm Analysis in Java","author":"M.A. Weiss","year":"1999","unstructured":"Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison Wesley Longman, Amsterdam (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89646-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:29:12Z","timestamp":1557959352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89646-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896456","9783540896463"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89646-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}