{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:06:04Z","timestamp":1781798764446,"version":"3.54.5"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031222023","type":"print"},{"value":"9783031222030","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_8","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"93-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Shape-Faithful Graph Drawings"],"prefix":"10.1007","author":[{"given":"Amyra","family":"Meidiana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-58950-3_388","volume-title":"Graph Drawing","author":"G Di Battista","year":"1995","unstructured":"Di Battista, G., Lenhart, W., Liotta, G.: Proximity drawability: a survey extended abstract. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 328\u2013339. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-58950-3_388"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BFb0021802","volume-title":"Graph Drawing","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Liotta, G., Whitesides, S.: The strength of weak proximity (extended abstract). In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 178\u2013189. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021802"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02086609","volume":"16","author":"P Bose","year":"1996","unstructured":"Bose, P., Lenhart, W., Liotta, G.: Characterizing proximity trees. Algorithmica 16(1), 83\u2013110 (1996)","journal-title":"Algorithmica"},{"key":"8_CR4","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Handbook of Graph Drawing and Visualization 2011, pp. 543\u2013569 (2013)"},{"issue":"03","key":"8_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Int. J. Comput. Geom. Appl. 7(03), 211\u2013223 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"8_CR6","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00405","volume":"21","author":"P Eades","year":"2017","unstructured":"Eades, P., Hong, S.H., Nguyen, A., Klein, K.: Shape-based quality metrics for large graph visualization. J. Graph Algorithms Appl. 21(1), 29\u201353 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-25878-7_17","volume-title":"Graph Drawing","author":"W Evans","year":"2012","unstructured":"Evans, W., Gansner, E.R., Kaufmann, M., Liotta, G., Meijer, H., Spillner, A.: Approximate proximity drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 166\u2013178. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_17"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Experience 21(11), 1129\u20131164 (1991)","DOI":"10.1002\/spe.4380211102"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"KR Gabriel","year":"1969","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Zool. 18(3), 259\u2013278 (1969)","journal-title":"Syst. Zool."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"ER Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_25"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285\u2013295. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_29"},{"key":"8_CR13","unstructured":"Hagberg, A., Swart, P., Chult, D.S.: Exploring network structure, dynamics, and function using networkx. Tech. rep., Los Alamos National Lab. (LANL), Los Alamos, NM (United States) (1 2008)"},{"issue":"1","key":"8_CR14","first-page":"37","volume":"10","author":"Y Hu","year":"2005","unstructured":"Hu, Y.: Efficient, high-quality force-directed graph drawing. Math. J. 10(1), 37\u201371 (2005)","journal-title":"Math. J."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Jaccard, P.: The distribution of the flora in the alpine zone. 1. New Phytol. 11(2), 37\u201350 (1912)","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/cgf.13187","volume":"36","author":"JF Kruiger","year":"2017","unstructured":"Kruiger, J.F., Rauber, P.E., Martins, R.M., Kerren, A., Kobourov, S., Telea, A.C.: Graph layouts by t-SNE. Comput. Graph. Forum 36(3), 283\u2013294 (2017). https:\/\/doi.org\/10.1111\/cgf.13187","journal-title":"Comput. Graph. Forum"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-62495-3_55","volume-title":"Graph Drawing","author":"W Lenhart","year":"1997","unstructured":"Lenhart, W., Liotta, G.: Proximity drawings of outerplanar graphs (extended abstract). In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 286\u2013302. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_55"},{"key":"8_CR18","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (Jun 2014)"},{"key":"8_CR19","unstructured":"Liotta, G.: Proximity Drawings. chap. 4, pp. 115\u2013154 (2013)"},{"issue":"86","key":"8_CR20","first-page":"2579","volume":"9","author":"L van der Maaten","year":"2008","unstructured":"van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(86), 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Meidiana, A., Hong, S.H., Eades, P.: Shape-faithful graph drawings (2022). https:\/\/arxiv.org\/abs\/2208.14095","DOI":"10.1007\/978-3-031-22203-0_8"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-24595-7_40","volume-title":"Graph Drawing","author":"A Noack","year":"2004","unstructured":"Noack, A.: An energy model for visual graph clustering. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 425\u2013436. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_40"},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.7155\/jgaa.00370","volume":"19","author":"A Nocaj","year":"2015","unstructured":"Nocaj, A., Ortmann, M., Brandes, U.: Untangling the hairballs of multi-centered, small-world online social media networks. J. Graph Algorithms Appl. 19(2), 595\u2013618 (2015). https:\/\/doi.org\/10.7155\/jgaa.00370","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Preparata, F.P., Shamos, M.I.: Computational geometry: an introduction. Springer Science and Business Media, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"8_CR25","unstructured":"Toth, C.D., O\u2019Rourke, J., Goodman, J.E.: Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (2017)"},{"issue":"4","key":"8_CR26","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12(4), 261\u2013268 (1980)","journal-title":"Pattern Recogn."},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Walker, J.Q.: A node-positioning algorithm for general trees. Softw. Pract. Experience 20(7), 685\u2013705 (1990)","DOI":"10.1002\/spe.4380200705"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-18638-7_8","volume-title":"Graph Drawing Software. Mathematics and Visualization","author":"R Wiese","year":"2004","unstructured":"Wiese, R., Eiglsperger, M., Kaufmann, M.: yFiles - visualization and automatic layout of graphs. In: J\u00fcnger, M., Mutzel, P. (eds.) Graph Drawing Software. Mathematics and Visualization, pp. 173\u2013191. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-642-18638-7_8"},{"issue":"9","key":"8_CR29","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1109\/TVCG.2018.2859997","volume":"25","author":"JX Zheng","year":"2018","unstructured":"Zheng, J.X., Pawar, S., Goodman, D.F.: Graph drawing by stochastic gradient descent. IEEE Trans. Visual. Comput. Graphics 25(9), 2738\u20132748 (2018)","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"key":"8_CR30","unstructured":"Zitnik, M., Sosi\u010d, R., Maheshwari, S., Leskovec, J.: BioSNAP Datasets: stanford biomedical network dataset collection. http:\/\/snap.stanford.edu\/biodata (2018)"}],"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-031-22203-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:03:45Z","timestamp":1704351825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"70","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":"25","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":"7","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":"36% - 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.01","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":"7.03","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)"}}]}}