{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:15Z","timestamp":1759638675154,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030044138"},{"type":"electronic","value":"9783030044145"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04414-5_35","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T18:20:45Z","timestamp":1545070845000},"page":"495-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Greedy Rectilinear Drawings"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Prutkin","sequence":"additional","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]},{"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"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"},{"key":"35_CR2","unstructured":"Angelini, P., et al.: Greedy rectilinear drawings. Arxiv report 1808.09063 (2018). http:\/\/arxiv.org\/abs\/1808.09063"},{"issue":"3","key":"35_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). https:\/\/doi.org\/10.1002\/net.21449","journal-title":"Networks"},{"issue":"1","key":"35_CR4","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). https:\/\/doi.org\/10.7155\/jgaa.00197","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"35_CR5","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"12","author":"C Batini","year":"1986","unstructured":"Batini, C., Nardelli, E., Tamassia, R.: A layout algorithm for data flow diagrams. IEEE Trans. Software Eng. 12(4), 538\u2013546 (1986). https:\/\/doi.org\/10.1109\/TSE.1986.6312901","journal-title":"IEEE Trans. Software Eng."},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0925-7721(99)00054-1","volume":"16","author":"SS Bridgeman","year":"2000","unstructured":"Bridgeman, S.S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L.: Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom. 16(1), 53\u201393 (2000). https:\/\/doi.org\/10.1016\/S0925-7721(99)00054-1","journal-title":"Comput. Geom."},{"key":"35_CR7","doi-asserted-by":"publisher","unstructured":"Da Lozzo, G., D\u2019Angelo, A., Frati, F.: On planar greedy drawings of 3-connected planar graphs. In: Aronov, B., Katz, M.J. (eds.) Proceedings 33rd International Symposium on Computational Geometry (SoCG 2017). LIPIcs, vol. 77, pp. 33:1\u201333:16 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.33","DOI":"10.4230\/LIPIcs.SoCG.2017.33"},{"issue":"2","key":"35_CR8","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). https:\/\/doi.org\/10.1007\/s00454-009-9235-6","journal-title":"Discrete Comput. Geom."},{"key":"35_CR9","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"35_CR10","unstructured":"Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization. Chapman and Hall\/CRC (2013). https:\/\/cs.brown.edu\/~rt\/gdhandbook\/"},{"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). https:\/\/doi.org\/10.1109\/TC.2010.257","journal-title":"IEEE Trans. Comput."},{"key":"35_CR12","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"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1137\/1.9781611973082.115","volume-title":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Xin He","year":"2011","unstructured":"He, X., Zhang, H.: On succinct convex greedy drawing of 3-connected plane graphs. In: Randall, D. (ed.) Proceedings 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 1477\u20131486. SIAM (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.115"},{"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). https:\/\/doi.org\/10.1007\/s00453-012-9682-y","journal-title":"Algorithmica"},{"key":"35_CR15","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. 125, 441\u2013443 (1999). https:\/\/doi.org\/10.1017\/S0305004198003016","journal-title":"Math. Proc. Camb. Phil. Soc."},{"issue":"3","key":"35_CR16","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). https:\/\/doi.org\/10.1007\/s00454-009-9227-6","journal-title":"Discrete Comput. Geom."},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.12.029","volume":"621","author":"P Leone","year":"2016","unstructured":"Leone, P., Samarasinghe, K.: Geographic routing on virtual raw anchor coordinate systems. Theor. Comput. Sci. 621, 1\u201313 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.12.029","journal-title":"Theor. Comput. Sci."},{"key":"35_CR18","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. 8125, pp. 767\u2013778. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_65"},{"issue":"1","key":"35_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.20382\/jocg.v7i1a3","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). https:\/\/doi.org\/10.20382\/jocg.v7i1a3","journal-title":"J. Comput. Geom."},{"key":"35_CR20","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"},{"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. Theor. Comput. Sci. 344(1), 3\u201314 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.06.022","journal-title":"Theor. Comput. Sci."},{"key":"35_CR22","doi-asserted-by":"publisher","unstructured":"Rao, A., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Johnson, D.B., Joseph, A.D., Vaidya, N.H. (eds.) Proceedings of 9th Annual International Conference on Mobile Computing and Networking (MOBICOM 2003), pp. 96\u2013108. ACM (2003). https:\/\/doi.org\/10.1145\/938985.938996","DOI":"10.1145\/938985.938996"},{"issue":"3","key":"35_CR23","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987). https:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2013.05.024","volume":"532","author":"J Wang","year":"2014","unstructured":"Wang, J., He, X.: Succinct strictly convex greedy drawing of 3-connected plane graphs. Theor. Comput. Sci. 532, 80\u201390 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.05.024","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04414-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:21:50Z","timestamp":1710249710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","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":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","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":"85","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":"41","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":"48% - 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":"3.25","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":"3.92","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The book also contains 1 full invited paper and 1 contest report","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}