{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:17:05Z","timestamp":1778815025223,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T00:00:00Z","timestamp":1526860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PRIN 20157EFM5C"],"award-info":[{"award-number":["PRIN 20157EFM5C"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["734922"],"award-info":[{"award-number":["734922"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00454-018-0001-5","type":"journal-article","created":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T13:46:30Z","timestamp":1526910390000},"page":"114-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Planar Greedy Drawings of 3-Connected Planar Graphs"],"prefix":"10.1007","volume":"63","author":[{"given":"Giordano","family":"Da\u00a0Lozzo","sequence":"first","affiliation":[]},{"given":"Anthony","family":"D\u2019Angelo","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,21]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-642-36763-2_23","volume-title":"20th International Symposium on Graph Drawing (GD\u201912)","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.) 20th International Symposium on Graph Drawing (GD\u201912). Lecture Notes in Computer Science, vol. 7704, pp. 260\u2013271. Springer, Heidelberg (2013)"},{"issue":"1","key":"1_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. 16(1), 5\u201335 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"1_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 59(3), 267\u2013274 (2012)","journal-title":"Networks"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-642-00219-9_4","volume-title":"16th International Symposium on Graph Drawing (GD\u201908)","author":"P Angelini","year":"2009","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. In: Tollis, I.G., Patrignani, M. (eds.) 16th International Symposium on Graph Drawing (GD\u201908). Lecture Notes in Computer Science, vol. 5417, pp. 26\u201337. Springer, Berlin (2009)"},{"issue":"1","key":"1_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. 14(1), 19\u201351 (2010)","journal-title":"J. Graph Algorithms Appl."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"731","DOI":"10.4153\/CJM-1966-073-4","volume":"18","author":"D Barnette","year":"1966","unstructured":"Barnette, D.: Trees in polyhedral graphs. Can. J. Math. 18, 731\u2013736 (1966)","journal-title":"Can. J. Math."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-50106-2_40","volume-title":"24th International Symposium on Graph Drawing and Network Visualization (GD\u201916)","author":"N Bonichon","year":"2016","unstructured":"Bonichon, N., Bose, P., Carmi, P., Kostitsyna, I., Lubiw, A., Verdonschot, S.: Gabriel triangulations and angle-monotone graphs: Local routing and recognition. In: Hu, Y., N\u00f6llenburg, M. (eds.) 24th International Symposium on Graph Drawing and Network Visualization (GD\u201916). Lecture Notes in Computer Science, vol. 9801, pp. 519\u2013531. Springer, Cham (2016)"},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovi\u0107, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609\u2013616 (2001)","journal-title":"Wirel. Netw."},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jctb.2002.2113","volume":"86","author":"G Chen","year":"2002","unstructured":"Chen, G., Yu, X.: Long cycles in 3-connected graphs. J. Comb. Theory Ser. B 86(1), 80\u201399 (2002)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-50106-2_13","volume-title":"24th International Symposium on Graph Drawing and Network Visualization (GD\u201916)","author":"G Lozzo Da","year":"2016","unstructured":"Da Lozzo, G., Dujmovi\u0107, V., Frati, F., Mchedlidze, T., Roselli, V.: Drawing planar graphs with many collinear vertices. In: Hu, Y., N\u00f6llenburg, M. (eds.) 24th International Symposium on Graph Drawing and Network Visualization (GD\u201916). Lecture Notes in Computer Science, vol. 9801, pp. 152\u2013165. Springer, Cham (2016)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"761","DOI":"10.7155\/jgaa.00348","volume":"19","author":"HR Dehkordi","year":"2015","unstructured":"Dehkordi, H.R., Frati, F., Gudmundsson, J.: Increasing-chord graphs on point sets. J. Graph Algorithms Appl. 19(2), 761\u2013778 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"1_CR12","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. 43(2), 375\u2013392 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"11","key":"1_CR13","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. Comput. 60(11), 1571\u20131580 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR14","unstructured":"Felsner, S., Igamberdiev, A., Kindermann, P., Klemz, B., Mchedlidze, T., Scheucher, M.: Strongly monotone drawings of planar graphs. In: 32nd International Symposium on Computational Geometry (SoCG\u201916). Leibniz International Proceedings in Informatics, vol.\u00a051, pp. 37:1\u201337:15. Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2016)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Finn, G.G.: Routing and addressing problems in large metropolitan-scale internetworks. Tech. Rep. ISI\/RR-87-180. University of Southern California, Information Sciences Institute (1987)","DOI":"10.21236\/ADA180187"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-1-84882-218-4_4","volume-title":"Guide to Wireless Sensor Networks: Computer Communications and Networks, Chap. 4","author":"H Frey","year":"2009","unstructured":"Frey, H., R\u00fchrup, S., Stojmenovi\u0107, I.: Routing in wireless sensor networks. In: Misra, S.C., Woungang, I., Misra, S. (eds.) Guide to Wireless Sensor Networks: Computer Communications and Networks, Chap. 4, pp. 81\u2013111. Springer, Berlin (2009)"},{"key":"1_CR17","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":"20th International Symposium on Algorithms and Computation (ISAAC\u201909)","author":"MT 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.H. (eds.) 20th International Symposium on Algorithms and Computation (ISAAC\u201909). Lecture Notes in Computer Science, vol. 5878, pp. 781\u2013791. Springer, Berlin (2009)"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-012-9682-y","volume":"68","author":"X He","year":"2014","unstructured":"He, X., Zhang, H.: On succinct greedy drawings of plane triangulations and 3-connected plane graphs. Algorithmica 68(2), 531\u2013544 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"1_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jda.2009.05.003","volume":"8","author":"S-H Hong","year":"2010","unstructured":"Hong, S.-H., Nagamochi, H.: Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms 8(3), 282\u2013295 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/978-3-662-45803-7_41","volume-title":"22nd International Symposium on Graph Drawing (GD\u201914)","author":"P Kindermann","year":"2014","unstructured":"Kindermann, P., Schulz, A., Spoerhase, J., Wolff, A.: On monotone drawings of trees. In: Duncan, C.A., Symvonis, A. (eds.) 22nd International Symposium on Graph Drawing (GD\u201914). Lecture Notes in Computer Science, vol. 8871, pp. 488\u2013500. Springer, Heidelberg (2014)"},{"key":"1_CR21","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG\u201999), pp. 51\u201354 (1999)"},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TNET.2007.900372","volume":"16","author":"F Kuhn","year":"2008","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: An algorithmic approach to geographic routing in ad hoc and sensor networks. IEEE\/ACM Trans. Netw. 16(1), 51\u201362 (2008)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"T Leighton","year":"2010","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. Discrete Comput. Geom. 44(3), 686\u2013705 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Moitra, A., Leighton, T.: Some results on greedy embeddings in metric spaces. In: Ravi, R. (ed.) Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201908), pp. 337\u2013346. IEEE Computer Society (2008)","DOI":"10.1109\/FOCS.2008.18"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s00454-017-9913-8","volume":"58","author":"M N\u00f6llenburg","year":"2017","unstructured":"N\u00f6llenburg, M., Prutkin, R.: Euclidean greedy drawings of trees. Discrete Comput. Geom. 58(3), 543\u2013579 (2017)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"1_CR26","first-page":"47","volume":"7","author":"M N\u00f6llenburg","year":"2016","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1), 47\u201369 (2016)","journal-title":"J. Comput. Geom."},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-540-27820-7_3","volume-title":"First International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS\u201904)","author":"CH Papadimitriou","year":"2004","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) First International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS\u201904). Lecture Notes in Computer Science, vol. 3121, pp. 9\u201317. Springer, Berlin (2004)"},{"issue":"1","key":"1_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"CH Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci. 344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR29","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/938985.938996","volume-title":"Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom\u201903)","author":"A Rao","year":"2003","unstructured":"Rao, A., Ratnasamy, S., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Johnson, D.B., Joseph, A.D., Vaidya, N.H. (eds.) Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom\u201903), pp. 96\u2013108. ACM, New York (2003)"},{"key":"1_CR30","volume-title":"Ad Hoc Wireless Networks: Architectures and Protocols","author":"C Siva Ram Murthy","year":"2004","unstructured":"Siva Ram Murthy, C., Manoj, B.: Ad Hoc Wireless Networks: Architectures and Protocols. Prentice Hall, Upper Saddle River (2004)"},{"key":"1_CR31","volume-title":"Ad Hoc Mobile Wireless Networks: Protocols and Systems","author":"CK Toh","year":"2002","unstructured":"Toh, C.K.: Ad Hoc Mobile Wireless Networks: Protocols and Systems. Prentice Hall, Upper Saddle River (2002)"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2013.05.024","volume":"532","author":"JJ Wang","year":"2014","unstructured":"Wang, J.J., He, X.: Succinct strictly convex greedy drawing of 3-connected plane graphs. Theor. Comput. Sci. 532, 80\u201390 (2014)","journal-title":"Theor. Comput. Sci."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-0001-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-018-0001-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-018-0001-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T18:54:58Z","timestamp":1693680898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-018-0001-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,21]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["1"],"URL":"https:\/\/doi.org\/10.1007\/s00454-018-0001-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,21]]},"assertion":[{"value":"11 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}