{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T04:06:02Z","timestamp":1751256362933,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319739144"},{"type":"electronic","value":"9783319739151"}],"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-319-73915-1_3","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"24-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Vertex- and Empty-Ply Proximity Drawings"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Chaplick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felice","family":"De Luca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Jaroslav","family":"Han\u010dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niklas","family":"Heinsohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-50106-2_19","volume-title":"Graph Drawing and Network Visualization","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Bekos, M.A., Bruckdorfer, T., Han\u010dl, J., Kaufmann, M., Kobourov, S., Symvonis, A., Valtr, P.: Low ply drawings of trees. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 236\u2013248. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_19"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P., Chaplick, S., De Luca, F., Fiala, J., Han\u010dl Jr., J., Heinsohn, N., Kaufmann, M., Kobourov, S., Kratochv\u00edl, J., Valtr, P.: On vertex- and empty-ply proximity drawings. ArXiv e-prints 1708.09233 (2017)","DOI":"10.1007\/978-3-319-73915-1_3"},{"issue":"12","key":"3_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(12), 3\u201324 (1998)","journal-title":"Comput. Geom."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-36763-2_7","volume-title":"Graph Drawing","author":"T Bruckdorfer","year":"2013","unstructured":"Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., N\u00f6llenburg, M., Wolff, A.: Progress on partial edge drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 67\u201378. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_7"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-30347-0_7","volume-title":"Fun with Algorithms","author":"T Bruckdorfer","year":"2012","unstructured":"Bruckdorfer, T., Kaufmann, M.: Mad at edge crossings? Break the edges!. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 40\u201350. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30347-0_7"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bruckdorfer, T., Kaufmann, M., Lauer, A.: A practical approach for 1\/4-SHPEDs. In: 6th International Conference on Information, Intelligence, Systems and Applications (IISA), pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/IISA.2015.7387994"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-53925-6_11","volume-title":"WALCOM: Algorithms and Computation","author":"F De Luca","year":"2017","unstructured":"De Luca, F., Di Giacomo, E., Didimo, W., Kobourov, S., Liotta, G.: An experimental study on the ply number of straight-line drawings. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 135\u2013148. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53925-6_11"},{"key":"3_CR8","unstructured":"Delaunay, B.: Sur la sph\u00e8re vide. a la m\u00e9moire de Georges Voronoi. Bulletin de l\u2019Acad\u00e9mie des Sciences de l\u2019URSS. Classe des sciences math\u00e9matiques et naturelles, vol. 6, pp. 793\u2013800 (1934)"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.jda.2005.12.004","volume":"4","author":"G Di Battista","year":"2006","unstructured":"Di Battista, G., Liotta, G., Whitesides, S.: The strength of weak proximity. J. Discrete Algorithms 4(3), 384\u2013400 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Didimo, W., Hong, S., Kaufmann, M., Kobourov, S.G., Liotta, G., Misue, K., Symvonis, A., Yen, H.: Low ply graph drawing. In: 6th International Conference on Information, Intelligence, Systems and Applications (IISA), pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/IISA.2015.7388020"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44969-8_6","volume-title":"Drawing Graphs","author":"M Eiglsperger","year":"2001","unstructured":"Eiglsperger, M., Fekete, S.P., Klau, G.W.: Orthogonal graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 121\u2013171. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8_6"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T.: Studying (non-planar) road networks through an algorithmic lens. In: Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 1\u201310. ACM (2008)","DOI":"10.1145\/1463434.1463455"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Thomson Leighton, F., Symvonis, A., Welzl, E., Woeginger, G.J.: Drawing graphs in the plane with high resolution. In: FOCS, pp. 86\u201395. IEEE Computer Society (1990)","DOI":"10.1109\/FSCS.1990.89527"},{"issue":"11","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Software Pract. Exp."},{"issue":"3","key":"3_CR15","first-page":"259","volume":"18","author":"KR Gabriel","year":"1969","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Biol. 18(3), 259\u2013278 (1969)","journal-title":"Syst. Biol."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Heinsohn, N., Kaufmann, M.: An interactive tool to explore and improve the ply number of drawings. In: Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017) (2017, to appear)","DOI":"10.1007\/978-3-319-73915-1_4"},{"key":"3_CR17","unstructured":"Liotta, G.: Proximity drawings. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 115\u2013154. Chapman and Hall\/CRC (2013)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Malitz, S.M., Papakostas, A.: On the angular resolution of planar graphs. In: Kosaraju, S.R., Fellows, M., Wigderson, A., Ellis, J.A. (eds.) ACM Symposium on Theory of Computing, pp. 527\u2013538. ACM (1992)","DOI":"10.1145\/129712.129764"},{"key":"3_CR19","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer, New York (1985)"},{"issue":"4","key":"3_CR20","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."}],"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-319-73915-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T23:09:09Z","timestamp":1751238549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_3","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":"21 January 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":"Boston","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}