{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:28:07Z","timestamp":1742966887187,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_19","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"206-217","source":"Crossref","is-referenced-by-count":26,"title":["Drawing Graphs with Right Angle Crossings"],"prefix":"10.1007","author":[{"given":"Walter","family":"Didimo","sequence":"first","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E. Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory, Ser. A\u00a0114(3), 563\u2013571 (2007)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica\u00a017(1), 1\u20139 (1997)","journal-title":"Combinatorica"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0406017","volume":"6","author":"G. Brightwell","year":"1993","unstructured":"Brightwell, G., Scheinerman, E.R.: Representations of planar graphs. SIAM J. Discrete Math.\u00a06(2), 214\u2013229 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"19_CR4","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00009471","volume":"22","author":"S. Felsner","year":"1999","unstructured":"Felsner, S.: Triangles in euclidean arrangements. Discrete & Computational Geometry\u00a022(3), 429\u2013438 (1999)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: APVIS, pp. 97\u2013100 (2007)","DOI":"10.1109\/APVIS.2007.329282"},{"key":"19_CR7","unstructured":"Huang, W.: An eye tracking study into the effects of graph layout. CoRR, abs\/0810.4431 (2008)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: PacificVis, pp. 41\u201346 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"volume-title":"Graph Drawing Software","year":"2003","key":"19_CR9","unstructured":"J\u00fcnger, M., Mutzel, P. (eds.): Graph Drawing Software. Springer, Heidelberg (2003)"},{"volume-title":"Drawing Graphs","year":"2001","key":"19_CR10","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. Springer, Heidelberg (2001)"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"key":"19_CR12","first-page":"219","volume-title":"Handbook of Discrete and Computational Geometry","author":"J. Pach","year":"2004","unstructured":"Pach, J.: Geometric graph theory. In: Handbook of Discrete and Computational Geometry, pp. 219\u2013238. CRC Press, Boca Raton (2004)"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J. Pach","year":"2006","unstructured":"Pach, J., Radoicic, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discrete & Computational Geometry\u00a036(4), 527\u2013552 (2006)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-44400-8_24","volume-title":"Discrete and Computational Geometry","author":"J. Pach","year":"2003","unstructured":"Pach, J., Radoicic, R., T\u00f3th, G.: Relaxing planarity for topological graphs. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol.\u00a02866, pp. 221\u2013232. Springer, Heidelberg (2003)"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s004539910006","volume":"26","author":"A. Papakostas","year":"2000","unstructured":"Papakostas, A., Tollis, I.G.: Efficient orthogonal drawings of high degree graphs. Algorithmica\u00a026(1), 100\u2013125 (2000)","journal-title":"Algorithmica"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"H.C. Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interacting with Computers\u00a013(2), 147\u2013162 (2000)","journal-title":"Interacting with Computers"},{"issue":"3","key":"19_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"H.C. Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.-A.: Empirical evaluation of aesthetics-based graph layout. Empirical Software Engineering\u00a07(3), 233\u2013255 (2002)","journal-title":"Empirical Software Engineering"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1996.0006","volume":"66","author":"J.-P. Roudneff","year":"1996","unstructured":"Roudneff, J.-P.: The maximum number of triangles in arrangements of pseudolines. J. Comb. Theory, Ser. B\u00a066(1), 44\u201374 (1996)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"9","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Trans. Circuit Syst.\u00a0CAS-36(9), 1230\u20131234 (1989)","journal-title":"IEEE Trans. Circuit Syst."},{"key":"19_CR20","unstructured":"Vignelli, M.: New york subway map, \n                  \n                    http:\/\/www.mensvogue.com\/design\/articles\/2008\/05\/vignelli"},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C. Ware","year":"2002","unstructured":"Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization\u00a01(2), 103\u2013110 (2002)","journal-title":"Information Visualization"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:33:49Z","timestamp":1578530029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_19"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}