{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:55Z","timestamp":1770994075556,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642367625","type":"print"},{"value":"9783642367632","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_41","type":"book-chapter","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T03:17:33Z","timestamp":1360811853000},"page":"463-474","source":"Crossref","is-referenced-by-count":22,"title":["Drawing Metro Maps Using B\u00e9zier Curves"],"prefix":"10.1007","author":[{"given":"Martin","family":"Fink","sequence":"first","affiliation":[]},{"given":"Herman","family":"Haverkort","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Maxwell","family":"Roberts","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Schuhmann","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-46648-7_36","volume-title":"Graph Drawing","author":"F. Bertault","year":"1999","unstructured":"Bertault, F.: A Force-Directed Algorithm that Preserves Edge Crossing Properties. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 351\u2013358. Springer, Heidelberg (1999)"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-44969-8_4","volume-title":"Drawing Graphs","author":"U. Brandes","year":"2001","unstructured":"Brandes, U.: Drawing on Physical Analogies. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol.\u00a02025, pp. 71\u201386. Springer, Heidelberg (2001)"},{"issue":"3","key":"41_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00028","volume":"4","author":"U. Brandes","year":"2000","unstructured":"Brandes, U., Wagner, D.: Using graph layout to visualize train connection data. J. Graph Algorithms Appl.\u00a04(3), 135\u2013155 (2000)","journal-title":"J. Graph Algorithms Appl."},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-31843-9_46","volume-title":"Graph Drawing","author":"B. Finkel","year":"2005","unstructured":"Finkel, B., Tamassia, R.: Curvilinear Graph Drawing Using the Force-Directed Method. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 448\u2013453. Springer, Heidelberg (2005)"},{"issue":"11","key":"41_CR5","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper.\u00a021(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exper."},{"issue":"3","key":"41_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jvlc.2005.09.001","volume":"17","author":"S.H. Hong","year":"2006","unstructured":"Hong, S.H., Merrick, D., do Nascimento, H.A.D.: Automatic visualisation of metro maps. J. Visual Lang. Comput.\u00a017(3), 203\u2013224 (2006)","journal-title":"J. Visual Lang. Comput."},{"issue":"5","key":"41_CR7","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TVCG.2010.81","volume":"17","author":"M. N\u00f6llenburg","year":"2011","unstructured":"N\u00f6llenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Visual. Comput. Graphics\u00a017(5), 626\u2013641 (2011)","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"key":"41_CR8","volume-title":"Metro maps of the world","author":"M. Ovenden","year":"2003","unstructured":"Ovenden, M.: Metro maps of the world, 2nd edn. Capital Transport Publishing, Harrow Weald (2003)","edition":"2"},{"key":"41_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04919-8","volume-title":"B\u00e9zier and B-Spline Techniques","author":"H. Prautzsch","year":"2002","unstructured":"Prautzsch, H., Boehm, W., Paluszny, M.: B\u00e9zier and B-Spline Techniques. Springer, Heidelberg (2002)"},{"key":"41_CR10","unstructured":"Roberts, M.J.: Underground maps unravelled: Explorations in information design. Published by the author, Wivenhoe (2012), \n                    \n                      http:\/\/privatewww.essex.ac.uk\/~mjr"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.ijhcs.2012.09.004","volume":"71","author":"M.J. Roberts","year":"2013","unstructured":"Roberts, M.J., Newton, E.J., Lagattolla, F.D., Hughes, S., Hasler, M.C.: Objective versus subjective measures of Paris metro map usability: Investigating traditional octolinear versus all-curves schematics. Int. J. Human-Comput. Studies\u00a071, 363\u2013386 (2013)","journal-title":"Int. J. Human-Comput. Studies"},{"issue":"1","key":"41_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TVCG.2010.24","volume":"17","author":"J. Stott","year":"2011","unstructured":"Stott, J., Rodgers, P., Mart\u00ednez-Ovando, J.C., Walker, S.G.: Automatic metro map layout using multicriteria optimization. IEEE Trans. Visual. Comput. Graphics\u00a017(1), 101\u2013114 (2011)","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"issue":"12","key":"41_CR13","doi-asserted-by":"publisher","first-page":"2528","DOI":"10.1109\/TVCG.2011.205","volume":"17","author":"Y.S. Wang","year":"2011","unstructured":"Wang, Y.S., Chi, M.T.: Focus+context metro maps. IEEE Trans. Visual. Comput. Graphics\u00a017(12), 2528\u20132535 (2011)","journal-title":"IEEE Trans. Visual. Comput. Graphics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T06:56:31Z","timestamp":1557557791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}