{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:15Z","timestamp":1725548955544},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118043"},{"type":"electronic","value":"9783642118050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_5","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T07:45:33Z","timestamp":1267775133000},"page":"21-32","source":"Crossref","is-referenced-by-count":10,"title":["On the Perspectives Opened by Right Angle Crossing Drawings"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Luca","family":"Cittadini","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00493-004-0012-0","volume":"24","author":"I. B\u00e1r\u00e1ny","year":"2004","unstructured":"B\u00e1r\u00e1ny, I., Tokushige, N.: The minimum area of convex lattice n-gons. Combinatorica\u00a024(2), 171\u2013185 (2004)","journal-title":"Combinatorica"},{"key":"5_CR2","volume-title":"Graphs","author":"C. Berge","year":"1985","unstructured":"Berge, C.: Graphs. North Holland, Amsterdam (1985)"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"5_CR4","volume-title":"Graph Drawing","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science\u00a061, 175\u2013198 (1988)","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete & Computational Geometry\u00a07, 381\u2013401 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-642-03367-4_19","volume-title":"WADS 2009","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"issue":"1-3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","volume":"103","author":"P. Eades","year":"2000","unstructured":"Eades, P., Symvonis, A., Whitesides, S.: Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathematics\u00a0103(1-3), 55\u201387 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR10","unstructured":"Huang, W.: An eye tracking study into the effects of graph layout. CoRR, abs\/0810.4431 (2008)"},{"key":"5_CR11","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":"Drawing Graphs","year":"2001","key":"5_CR12","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. Springer, Heidelberg (2001)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-58950-3_385","volume-title":"Graph Drawing","author":"A. Papakostas","year":"1995","unstructured":"Papakostas, A.: Upward planarity testing of outerplanar dags. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 298\u2013306. Springer, Heidelberg (1995)"},{"issue":"1-2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry\u00a09(1-2), 83\u2013110 (1998)","journal-title":"Computational Geometry"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"Petersen, J.: Die theorie der regul\u00e4ren graphen. Acta Mathematicae\u00a015, 193\u2013220 (1891)","journal-title":"Acta Mathematicae"},{"issue":"2","key":"5_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":"5_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"},{"key":"5_CR18","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990, pp. 138\u2013148 (1990)"},{"issue":"2","key":"5_CR19","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","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11805-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T17:58:09Z","timestamp":1552413489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}