{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:27Z","timestamp":1725807867493},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_40","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:12:53Z","timestamp":1417414373000},"page":"476-487","source":"Crossref","is-referenced-by-count":3,"title":["On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Prutkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-36763-2_23","volume-title":"Graph Drawing","author":"S. Alamdari","year":"2013","unstructured":"Alamdari, S., Chan, T.M., Grant, E., Lubiw, A., Pathak, V.: Self-approaching Graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 260\u2013271. Springer, Heidelberg (2013)"},{"issue":"1","key":"40_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00249","volume":"16","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. J. Graph Algorithms Appl.\u00a016(1), 5\u201335 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"40_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/net.21449","volume":"59","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F.: Succinct greedy drawings do not always exist. Networks\u00a059(3), 267\u2013274 (2012)","journal-title":"Networks"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-25878-7_36","volume-title":"Graph Drawing","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wismath, S.: Monotone drawings of graphs with fixed embedding. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 379\u2013390. Springer, Heidelberg (2012)"},{"issue":"1","key":"40_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00197","volume":"14","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Algorithms Appl.\u00a014(1), 19\u201351 (2010)","journal-title":"J. Graph Algorithms Appl."},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00454-009-9235-6","volume":"43","author":"R. Dhandapani","year":"2010","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. Discrete Comput. Geom.\u00a043, 375\u2013392 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"11","key":"40_CR7","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1109\/TC.2010.257","volume":"60","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Goodrich, M.T.: Succinct greedy geometric routing using hyperbolic geometry. IEEE Trans. Computers\u00a060(11), 1571\u20131580 (2011)","journal-title":"IEEE Trans. Computers"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Geometric Graphs and Arrangements. Vieweg+Teubner Verlag (2004)","DOI":"10.1007\/978-3-322-80303-0"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-642-10631-6_79","volume-title":"Algorithms and Computation","author":"M.T. Goodrich","year":"2009","unstructured":"Goodrich, M.T., Strash, D.: Succinct greedy geometric routing in the Euclidean plane. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 781\u2013791. Springer, Heidelberg (2009)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Huang, W., Eades, P., Hong, S.-H.: A graph reading behavior: Geodesic-path tendency. In: IEEE Pacific Visualization Symposium (PacificVis 2009), pp. 137\u2013144 (2009)","DOI":"10.1109\/PACIFICVIS.2009.4906848"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004198003016","volume":"125","author":"C. Icking","year":"1999","unstructured":"Icking, C., Klein, R., Langetepe, E.: Self-approaching curves. Math. Proc. Camb. Phil. Soc.\u00a0125, 441\u2013453 (1999)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Kleinberg, R.: Geographic routing using hyperbolic space. In: Computer Communications (INFOCOM 2007), pp. 1902\u20131909. IEEE (2007)","DOI":"10.1109\/INFCOM.2007.221"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"A. Moitra","year":"2010","unstructured":"Moitra, A., Leighton, T.: Some Results on Greedy Embeddings in Metric Spaces. Discrete Comput. Geom.\u00a044, 686\u2013705 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/978-3-642-40450-4_65","volume-title":"Algorithms \u2013 ESA 2013","author":"M. N\u00f6llenburg","year":"2013","unstructured":"N\u00f6llenburg, M., Prutkin, R.: Euclidean greedy drawings of trees. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 767\u2013778. Springer, Heidelberg (2013)"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. CoRR arXiv:1409.0315 (2014)","DOI":"10.1007\/978-3-662-45803-7_40"},{"issue":"1","key":"40_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci.\u00a0344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-36763-2_40","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"2013","unstructured":"Purchase, H.C., Hamer, J., N\u00f6llenburg, M., Kobourov, S.G.: On the usability of Lombardi graph drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 451\u2013462. Springer, Heidelberg (2013)"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Mobile Computing and Networking (MobiCom 2003), pp. 96\u2013108. ACM (2003)","DOI":"10.1145\/938985.938996"},{"key":"40_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0305004100071875","volume":"115","author":"G. Rote","year":"1994","unstructured":"Rote, G.: Curves with increasing chords. Math. Proc. Camb. Phil. Soc.\u00a0115, 1\u201312 (1994)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"40_CR20","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Discrete Algorithms (SODA 1990), pp. 138\u2013148. SIAM (1990)"},{"key":"40_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2013.05.024","volume":"532","author":"J.-J. Wang","year":"2014","unstructured":"Wang, J.-J., He, X.: Succinct strictly convex greedy drawing of 3-connected plane graphs. Theor. Comput. Sci.\u00a0532, 80\u201390 (2014)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T20:04:50Z","timestamp":1566072290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}