{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:10:59Z","timestamp":1746115859016,"version":"3.40.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_15","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"161-172","source":"Crossref","is-referenced-by-count":0,"title":["Achieving Good Angular Resolution in 3D Arc Diagrams"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Pszona","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Eppstein, D., Frati, F., Kaufmann, M., Lazard, S., Mchedlidze, T., Teillaud, M., Wolff, A.: Universal point sets for planar graph drawings with circular arcs (2013) (manuscript)","DOI":"10.7155\/jgaa.00324"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-46648-7_42","volume-title":"Graph Drawing","author":"U. Brandes","year":"1999","unstructured":"Brandes, U.: Hunting down Graph B. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 410\u2013415. Springer, Heidelberg (1999)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Brandes, U., Shubina, G., Tamassia, R.: Improving angular resolution in visualizations of geographic networks. In: Leeuw, W., Liere, R. (eds.) Data Visualization, Eurographics, pp. 23\u201332. Springer (2000)","DOI":"10.1007\/978-3-7091-6783-0_3"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Brandes, U., Shubina, G., Tamassia, R.: Improving angular resolution in visualizations of geographic networks. In: Proc. Joint Eurographics \u2014 IEEE TCVG Symposium on Visualization (VisSym\u00a02000) (2000)","DOI":"10.1007\/978-3-7091-6783-0_3"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s004540010080","volume":"25","author":"C. Cheng","year":"2001","unstructured":"Cheng, C., Duncan, C., Goodrich, M., Kobourov, S.: Drawing planar graphs with circular arcs. Discrete & Computational Geometry\u00a025(3), 405\u2013418 (2001)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1109\/72.485670","volume":"7","author":"A. Cimikowski","year":"1996","unstructured":"Cimikowski, A., Shope, P.: A neural-network algorithm for a graph layout problem. IEEE Trans. on Neural Networks\u00a07(2), 341\u2013345 (1996)","journal-title":"IEEE Trans. on Neural Networks"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R. Cohen","year":"1997","unstructured":"Cohen, R., Eades, P., Lin, T., Ruskey, F.: Three-dimensional graph drawing. Algorithmica\u00a017(2), 199\u2013208 (1997)","journal-title":"Algorithmica"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-45848-4_8","volume-title":"Graph Drawing","author":"H.N. Djidjev","year":"2002","unstructured":"Djidjev, H.N., Vrt\u2019o, I.: An improved lower bound for crossing numbers. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 96\u2013101. Springer, Heidelberg (2002)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","first-page":"308","volume-title":"GD 2011","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., L\u00f6ffler, M.: Planar and poly-arc Lombardi drawings. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 308\u2013319. Springer, Heidelberg (2011)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-18469-7_17","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Drawing trees with perfect angular resolution and polynomial area. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 183\u2013194. Springer, Heidelberg (2011)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-18469-7_18","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi drawings of graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 195\u2013207. Springer, Heidelberg (2011)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-18469-7_19","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., L\u00f6ffler, M., Mumford, E., N\u00f6llenburg, M.: Optimal 3d angular resolution for low-degree graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 208\u2013219. Springer, Heidelberg (2011)"},{"key":"15_CR13","first-page":"66","volume":"53","author":"L. Fejes T\u00f3th","year":"1943","unstructured":"Fejes T\u00f3th, L.: \u00dcber die Absch\u00e4tzung des k\u00fcrzesten Abstandes zweier Punkte eneis auf einer Kugelfl\u00e4che liegenden Punktsystems. Jbf. Deutsch. Math. Verein\u00a053, 66\u201368 (1943)","journal-title":"Jbf. Deutsch. Math. Verein"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., 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"},{"key":"15_CR15","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)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-61680-2_43","volume-title":"Algorithms - ESA \u201996","author":"A. Garg","year":"1996","unstructured":"Garg, A., Tamassia, R., Vocca, P.: Drawing with colors. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 12\u201326. Springer, Heidelberg (1996)"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1006\/jagm.2000.1115","volume":"37","author":"M.T. Goodrich","year":"2000","unstructured":"Goodrich, M.T., Wagner, C.G.: A framework for drawing planar graphs with curves and polylines. Journal of Algorithms\u00a037(2), 399\u2013421 (2000)","journal-title":"Journal of Algorithms"},{"key":"15_CR18","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)"},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1049\/piee.1968.0004","volume":"115","author":"T. Nicholson","year":"1968","unstructured":"Nicholson, T.: Permutation procedure for minimising the number of crossings in a network. Proc. of the Inst. of Electrical Engineers\u00a0115(1), 21\u201326 (1968)","journal-title":"Proc. of the Inst. of Electrical Engineers"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1073\/pnas.52.3.688","volume":"52","author":"T.L. Saaty","year":"1964","unstructured":"Saaty, T.L.: The minimum number of intersections in complete graphs. Proceedings of the National Academy of Sciences of the United States of America\u00a052(3), 688\u2013690 (1964)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"15_CR21","first-page":"1","volume":"27","author":"P. Tammes","year":"1930","unstructured":"Tammes, P.: On the origin of number and arrangements of the places of exit on the surface of pollen grains. Rec. Trav. Bot. Neerl.\u00a027, 1\u201381 (1930)","journal-title":"Rec. Trav. Bot. Neerl."},{"key":"15_CR22","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz.\u00a03, 25\u201330 (1964)","journal-title":"Diskret. Analiz."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Wattenberg, M.: Arc diagrams: Visualizing structure in strings. In: IEEE Symp. on Information Visualization (InfoVis), pp. 110\u2013116 (2002)","DOI":"10.1109\/INFVIS.2002.1173155"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:56:33Z","timestamp":1746060993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}