{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:10:35Z","timestamp":1725577835072},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_19","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"208-219","source":"Crossref","is-referenced-by-count":3,"title":["Optimal 3D Angular Resolution for Low-Degree Graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Mumford","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-11805-0_5","volume-title":"Graph Drawing","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 21\u201332. Springer, Heidelberg (2010), doi:10.1007\/978-3-642-11805-0_5"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/jagm.2000.1132","volume":"38","author":"T.C. Biedl","year":"2001","unstructured":"Biedl, T.C., Bose, P., Demaine, E.D., Lubiw, A.: Efficient algorithms for Petersen\u2019s matching theorem. Journal of Algorithms\u00a038(1), 110\u2013134 (2001), doi:10.1006\/jagm.2000.1132","journal-title":"Journal of Algorithms"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00453-005-1148-z","volume":"44","author":"T.C. Biedl","year":"2006","unstructured":"Biedl, T.C., Thiele, T., Wood, D.R.: Three-dimensional orthogonal graph drawing with optimal volume. Algorithmica\u00a044(3), 233\u2013255 (2006), doi:10.1007\/s00453-005-1148-z","journal-title":"Algorithmica"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-70904-6_9","volume-title":"Graph Drawing","author":"J. Carlson","year":"2007","unstructured":"Carlson, J., Eppstein, D.: Trees with convex faces and optimal angles. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 77\u201388. Springer, Heidelberg (2007)"},{"issue":"1829","key":"19_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1098\/rspa.1986.0056","volume":"405","author":"B.W. Clare","year":"1986","unstructured":"Clare, B.W., Kepert, D.L.: The closest packing of equal circles on a sphere. Proc. Roy. Soc. London A\u00a0405(1829), 329\u2013344 (1986), doi:10.1098\/rspa.1986.0056","journal-title":"Proc. Roy. Soc. London A"},{"key":"19_CR6","unstructured":"Demaine, E.D.: Problem 46: 3D minimum-bend orthogonal graph drawings. The Open Problems Project. Posed by David R. Wood at the CCCG, open-problem session (2002), \n                    \n                      http:\/\/maven.smith.edu\/~orourke\/TOPP\/P46.html"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-03367-4_19","volume-title":"Algorithms and Data Structures","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009), doi:10.1007\/978-3-642-03367-4_19"},{"key":"19_CR8","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. arXiv:0908.3545 (2009)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Proc. 20th ACM Symp. Computational Geometry (SoCG 2004), pp. 340\u2013346 (2004), doi:10.1145\/997817.997868, arXiv:cs.CG\/0312056","DOI":"10.1145\/997817.997868"},{"issue":"1-3","key":"19_CR10","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), doi:10.1016\/S0166-218X(00)00172-4","journal-title":"Discrete Applied Mathematics"},{"key":"19_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.\u00a02025, pp. 121\u2013171. Springer, Heidelberg (2001), doi:10.1007\/3-540-44969-8_6"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-642-00219-9_37","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D.: Isometric diamond subgraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 384\u2013389. Springer, Heidelberg (2009), doi:10.1007\/978-3-642-00219-9_37"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BFb0049393","volume-title":"Algorithms - ESA \u201994","author":"A. Garg","year":"1994","unstructured":"Garg, A., Tamassia, R.: Planar drawings and angular resolution: algorithms and bounds. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 12\u201323. Springer, Heidelberg (1994), doi:10.1007\/BFb0049393"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"1999","unstructured":"Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 167\u2013182. Springer, Heidelberg (1999), doi:10.1007\/3-540-37623-2_13"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: Proc. IEEE Pacific Visualization Symp., pp. 41\u201346 (2008), doi:10.1109\/PACIFICVIS.2008.4475457","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Malitz, S.: On the angular resolution of planar graphs. In: Proc. 24th ACM Symp. Theory of Computing (STOC 1992), pp. 527\u2013538 (1992), doi:10.1145\/129712.129764","DOI":"10.1145\/129712.129764"},{"issue":"1","key":"19_CR17","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 Graphs. Acta Math.\u00a015(1), 193\u2013220 (1891), doi:10.1007\/BF02392606","journal-title":"Acta Math."},{"key":"19_CR18","first-page":"1","volume":"27","author":"P.M.L. Tammes","year":"1930","unstructured":"Tammes, P.M.L.: On the origin of the number and arrangement of the places of exit on the surface of pollen grains. Ree. Trav. Bot. N\u00e9erl.\u00a027, 1\u201382 (1930)","journal-title":"Ree. Trav. Bot. N\u00e9erl."},{"issue":"1-3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(02)00044-0","volume":"299","author":"D.R. Wood","year":"2003","unstructured":"Wood, D.R.: Optimal three-dimensional orthogonal graph drawing in the general position model. Theor. Comput. Sci.\u00a0299(1-3), 151\u2013178 (2003), doi:10.1016\/S0304-3975(02)00044-0","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T03:28:58Z","timestamp":1553398138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}