{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:31:05Z","timestamp":1766377865365},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,11,27]],"date-time":"2012-11-27T00:00:00Z","timestamp":1353974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00454-012-9472-y","type":"journal-article","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T18:55:21Z","timestamp":1353956121000},"page":"157-182","source":"Crossref","is-referenced-by-count":11,"title":["Drawing Trees with Perfect Angular Resolution and Polynomial Area"],"prefix":"10.1007","volume":"49","author":[{"given":"Christian A.","family":"Duncan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,27]]},"reference":[{"issue":"3","key":"9472_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.7155\/jgaa.00028","volume":"4","author":"U Brandes","year":"2000","unstructured":"Brandes, U., Wagner, D.: Using graph layout to visualize train interconnection data. J. Graph Algorithms Appl. 4(3), 135\u2013155 (2000). doi: 10.7155\/jgaa.00028","journal-title":"J. Graph Algorithms Appl."},{"key":"9472_CR2","doi-asserted-by":"crossref","unstructured":"Buchheim, C., J\u00fcnger, M., Leipert, S.: Improving Walker\u2019s algorithm to run in linear time. In: Proceedings of 10th International Symposium on Graph Drawing (GD 2002). Lecture Notes in Computer Science, vol. 2528, pp. 344\u2013353. Springer (2002). doi: 10.1007\/3-540-36151-0_32","DOI":"10.1007\/3-540-36151-0_32"},{"issue":"2","key":"9472_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.comgeo.2008.05.003","volume":"42","author":"J Cappos","year":"2009","unstructured":"Cappos, J., Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Simultaneous graph embedding with bends and circular arcs. Comput. Geom. 42(2), 173\u2013182 (2009). doi: 10.1016\/j.comgeo.2008.05.003","journal-title":"Comput. Geom."},{"key":"9472_CR4","doi-asserted-by":"crossref","unstructured":"Carlson, J., Eppstein D.: Trees with convex faces and optimal angles. In: Proceedings of 14th International Symposium on Graph Drawing (GD 2006). Lecture Notes in Computer Science, vol. 4372, pp. 77\u201388. Springer (2007), arXiv:cs.CG\/0607113. doi: 10.1007\/978-3-540-70904-6_9","DOI":"10.1007\/978-3-540-70904-6_9"},{"issue":"2","key":"9472_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0925-7721(01)00066-9","volume":"23","author":"T Chan","year":"2002","unstructured":"Chan, T., Goodrich, M.T., Kosaraju, S.R., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. 23(2), 153\u2013162 (2002). doi: 10.1016\/S0925-7721(01)00066-9","journal-title":"Comput. Geom."},{"issue":"3","key":"9472_CR6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s004540010080","volume":"25","author":"CC Cheng","year":"2001","unstructured":"Cheng, C.C., Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Drawing planar graphs with circular arcs. Discrete Comput. Geom. 25(3), 405\u2013418 (2001). doi: 10.1007\/s004540010080","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9472_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.7155\/jgaa.00099","volume":"9","author":"M Dickerson","year":"2005","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.: Confluent drawings: Visualizing non-planar diagrams in a planar way. J. Graph Algorithms Appl. 9(1), 31\u201352 (2005). doi: 10.7155\/jgaa.00099","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"9472_CR8","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1142\/S0129054106004315","volume":"17","author":"CA Duncan","year":"2006","unstructured":"Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. Int. J. Found. Comput. Sci. 17(5), 1143\u20131164 (2006). doi: 10.1142\/S0129054106004315","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9472_CR9","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: Proceedings of 18th International Symposium on Graph Drawing (GD 2010). Lecture Notes in Computer Science, vol. 6502, pp. 183\u2013194. Springer (2011), arXiv:1009.058. doi: 10.1007\/978-3-642-18469-7_171"},{"key":"9472_CR10","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., L\u00f6ffler, M.: Planar and poly-arc Lombardi drawings. In: Proceedings of 19th International Symposium on Graph Drawing (GD 2011). Lecture Notes in Computer Science, vol. 7034, pp. 308\u2013319. Springer (2012), arXiv:1109.0345. doi: 10.1007\/978-3-642-25878-7_30","DOI":"10.1007\/978-3-642-25878-7_30"},{"issue":"1","key":"9472_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.7155\/jgaa.00251","volume":"16","author":"CA Duncan","year":"2012","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi drawings of graphs. J. Graph Algorithms Appl. 16(1), 85\u2013108 (2012). doi: 10.7155\/jgaa.00251","journal-title":"J. Graph Algorithms Appl."},{"key":"9472_CR12","first-page":"10","volume":"5","author":"P Eades","year":"1992","unstructured":"Eades, P.: Drawing free trees. Bull. Inst. Comb. Appl. 5, 10\u201336 (1992)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"9472_CR13","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: The graphs of planar soap bubbles. arXiv:1207.3761 (2012)","DOI":"10.1145\/2493132.2462370"},{"key":"9472_CR14","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Planar Lombardi drawings for subcubic graphs. In: Proceedings of 20th International Symposium on Graph Drawing (GD 2012), Lecture Notes in Computer Science (2013), arXiv:1206.6142. Springer (to appear)","DOI":"10.1007\/978-3-642-36763-2_12"},{"key":"9472_CR15","doi-asserted-by":"crossref","unstructured":"Finkel, B., Tamassia, R.: Curvilinear graph drawing using the force-directed method. In: Proceedings of 12th International Symposium on Graph Drawing (GD\u201904), Lecture Notes in Computer Science, vol. 3383, pp. 448\u2013453. Springer (2004). doi: 10.1007\/978-3-540-31843-9_46","DOI":"10.1007\/978-3-540-31843-9_46"},{"issue":"3","key":"9472_CR16","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1142\/S021819590800260X","volume":"18","author":"F Frati","year":"2008","unstructured":"Frati, F.: On minimum area planar upward drawings of directed trees and other families of directed acyclic graphs. Int. J. Comput. Geom. Appl. 18(3), 251\u2013271 (2008). doi: 10.1142\/S021819590800260X","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"9472_CR17","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1142\/S021819590300130X","volume":"13","author":"A Garg","year":"2003","unstructured":"Garg, A., Rusu, A.: Area-efficient order-preserving planar straight-line drawings of ordered trees. Int. J. Comput. Geom. Appl. 13(6), 487\u2013505 (2003). doi: 10.1142\/S021819590300130X","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9472_CR18","doi-asserted-by":"crossref","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of binary trees with linear area and arbitrary aspect ratio. J. Graph Algorithms Appl. 8(2), 135\u2013160 (2004). doi: 10.7155\/jgaa.00086","DOI":"10.7155\/jgaa.00086"},{"issue":"3","key":"9472_CR19","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1142\/S0218195996000228","volume":"6","author":"A Garg","year":"1996","unstructured":"Garg, A., Goodrich, M.T., Tamassia, R.: Planar upward tree drawings with optimal area. Int. J. Comput. Geom. Appl. 6(3), 333\u2013356 (1996). doi: 10.1142\/S0218195996000228","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9472_CR20","unstructured":"Grivet, S., Auber, D., Domenger, J.P., Melan\u00e7on, G.: Bubble tree drawing algorithm. In: Proceedings of International Conference on Computer Vision and Graphics, pp. 633\u2013641. Springer (2004). http:\/\/www.labri.fr\/publications\/is\/2004\/GADM04"},{"key":"9472_CR21","doi-asserted-by":"crossref","unstructured":"Halupczok, I., Schulz, A.: Pinning balloons with perfect angles and optimal area. In: Proceedings of 19th International Symposium on Graph Drawing (GD 2011). Lecture Notes in Computer Science, vol. 7034, pp. 154\u2013165. Springer (2011). doi: 10.1007\/978-3-642-25878-7_16","DOI":"10.1007\/978-3-642-25878-7_16"},{"issue":"2","key":"9472_CR22","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984). doi: 10.1137\/0213024","journal-title":"SIAM J. Comput."},{"key":"9472_CR23","volume-title":"Mark Lombardi: Global Networks","author":"R Hobbs","year":"2003","unstructured":"Hobbs, R., Lombardi, M.: Mark Lombardi: Global Networks. Independent Curators International, New York (2003)"},{"issue":"2","key":"9472_CR24","doi-asserted-by":"crossref","first-page":"431","DOI":"10.7155\/jgaa.00153","volume":"11","author":"C-C Lin","year":"2007","unstructured":"Lin, C.-C., Yen, H.-C.: On balloon drawings of rooted trees. J. Graph Algorithms Appl. 11(2), 431\u2013452 (2007). doi: 10.7155\/jgaa.00153","journal-title":"J. Graph Algorithms Appl."},{"key":"9472_CR25","doi-asserted-by":"crossref","unstructured":"L\u00f6ffler, M., N\u00f6llenburg, M.: Planar Lombardi drawings of outerpaths. In: Proceedings of 20th International Symposium on Graph Drawing (GD 2012). Lecture Notes in Computer Science (2013) Springer (to appear)","DOI":"10.1007\/978-3-642-36763-2_53"},{"key":"9472_CR26","unstructured":"Melan\u00e7on, G., Herman, I.: Circular Drawings of Rooted Trees. Tech. Rep. INS-R9817, CWI Amsterdam (1998)"},{"key":"9472_CR27","doi-asserted-by":"crossref","unstructured":"Purchase, H.C., Hamer, J., N\u00f6llenburg, M., Kobourov, S.G.: On the usability of Lombardi graph drawings. In: Proceedings of 20th International Symposium on Graph Drawing (GD 2012), Lecture Notes in Computer Science (2012). Springer (to appear)","DOI":"10.1007\/978-3-642-36763-2_40"},{"issue":"2","key":"9472_CR28","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"EM Reingold","year":"1981","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Softw. Eng. 7(2), 223\u2013228 (1981). doi: 10.1109\/TSE.1981.234519","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"9472_CR29","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0925-7721(99)00053-X","volume":"15","author":"C-S Shin","year":"2000","unstructured":"Shin, C.-S., Kim, S.K., Chwa, K.-Y.: Area-efficient algorithms for straight-line tree drawings. Comput. Geom. 15(4), 175\u2013202 (2000). doi: 10.1016\/S0925-7721(99)00053-X","journal-title":"Comput. Geom."},{"issue":"7","key":"9472_CR30","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"J Walker","year":"1990","unstructured":"Walker, J.: A node-positioning algorithm for general trees. Softw. Pract. Experience 20(7), 685\u2013705 (1990). doi: 10.1002\/spe.4380200705","journal-title":"Softw. Pract. Experience"},{"issue":"5","key":"9472_CR31","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TSE.1979.234212","volume":"5","author":"C Wetherell","year":"1979","unstructured":"Wetherell, C., Shannon, A.: Tidy drawings of trees. IEEE Trans. Softw. Eng. 5(5), 514\u2013520 (1979). doi: 10.1109\/TSE.1979.234212","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9472_CR32","unstructured":"Xu, K., Rooney, C., Passmore, P., Ham, D.-H.: A user study on curved edges in graph visualization. IEEE Trans. Vis. Comput. Graph. 18(12), 2449\u20132456 (2012)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9472-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9472-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9472-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T03:56:27Z","timestamp":1562385387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9472-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,27]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9472"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9472-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,27]]}}}