{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:19:42Z","timestamp":1743005982474,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_35","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"435-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Area Requirements of Planar Greedy Drawings of Triconnected Planar\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[]},{"given":"Anthony","family":"D\u2019Angelo","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"35_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. 7704, pp. 260\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_23"},{"issue":"3","key":"35_CR2","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"},{"issue":"1","key":"35_CR3","first-page":"19","volume":"14","author":"P Angelini","year":"2010","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Alg. Appl. 14(1), 19\u201351 (2010)","journal-title":"J. Graph Alg. Appl."},{"key":"35_CR4","first-page":"199","volume":"2018","author":"T Bl\u00e4sius","year":"2018","unstructured":"Bl\u00e4sius, T., Friedrich, T., Katzmann, M., Krohmer, A.: Hyperbolic embeddings for near-optimal greedy routing. ALENEX 2018, 199\u2013208 (2018)","journal-title":"ALENEX"},{"key":"35_CR5","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":"Graph Drawing and Network Visualization","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.) GD 2016. LNCS, vol. 9801, pp. 519\u2013531. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_40"},{"key":"35_CR6","unstructured":"Brehm, E.: $$3$$-orientations and Schnyder $$3$$-tree decompositions. Ph.D. thesis, Freie Universit\u00e4t Berlin (2000)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Cao, L., Strelzoff, A., Sun, J.Z.: On succinctness of geometric greedy routing in Euclidean plane. In: ISPAN 2009, pp. 326\u2013331. IEEE Computer Society (2009)","DOI":"10.1109\/I-SPAN.2009.20"},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s00454-018-0001-5","volume":"63","author":"G Da Lozzo","year":"2020","unstructured":"Da Lozzo, G., D\u2019Angelo, A., Frati, F.: On planar greedy drawings of 3-connected planar graphs. Discret. Comput. Geom. 63(1), 114\u2013157 (2020)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"35_CR9","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 Alg. Appl. 19(2), 761\u2013778 (2015)","journal-title":"J. Graph Alg. Appl."},{"issue":"2","key":"35_CR10","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":"35_CR11","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":"35_CR12","doi-asserted-by":"crossref","unstructured":"Felsner, S., Zickfeld, F.: On the number of planar orientations with prescribed degrees. Electr. J. Comb. 15(1) (2008)","DOI":"10.37236\/801"},{"key":"35_CR13","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":"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. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 781\u2013791. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_79"},{"issue":"2","key":"35_CR14","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":"35_CR15","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."},{"issue":"2","key":"35_CR16","first-page":"345","volume":"23","author":"A Lubiw","year":"2019","unstructured":"Lubiw, A., Mondal, D.: Construction and local routing for angle-monotone graphs. J. Graph Alg. Appl. 23(2), 345\u2013369 (2019)","journal-title":"J. Graph Alg. Appl."},{"key":"35_CR17","unstructured":"Lubiw, A., O\u2019Rourke, J.: Angle-monotone paths in non-obtuse triangulations. In: CCCG 2017, pp. 25\u201330 (2017)"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Muhammad, R.: A distributed geometric routing algorithm for ad hoc wireless networks. In: ITNG 2007, pp. 961\u2013963. IEEE (2007)","DOI":"10.1109\/ITNG.2007.4"},{"issue":"1","key":"35_CR19","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."},{"issue":"3","key":"35_CR20","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":"35_CR21","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. Theoret. Comput. Sci. 344(1), 3\u201314 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR22","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":"Algorithmic Aspects of Wireless Sensor Networks","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.) ALGOSENSORS 2004. LNCS, vol. 3121, pp. 9\u201317. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27820-7_3"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Rao, A., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: MOBICOM 2003, pp. 96\u2013108. ACM (2003)","DOI":"10.1145\/938985.938996"},{"key":"35_CR24","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990, pp. 138\u2013148. SIAM (1990)"},{"key":"35_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.comcom.2017.10.014","volume":"114","author":"Y Sun","year":"2017","unstructured":"Sun, Y., Zhang, Y., Fang, B., Zhang, H.: Succinct and practical greedy embedding for geometric routing. Comput. Commun. 114, 51\u201361 (2017)","journal-title":"Comput. Commun."},{"key":"35_CR26","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. Theoret. Comput. Sci. 532, 80\u201390 (2014)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:40:35Z","timestamp":1619242835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}