{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:11:10Z","timestamp":1725577870595},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_17","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"183-194","source":"Crossref","is-referenced-by-count":11,"title":["Drawing Trees with Perfect Angular Resolution and Polynomial Area"],"prefix":"10.1007","author":[{"given":"Christian A.","family":"Duncan","sequence":"first","affiliation":[]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","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.\u00a04(3), 135\u2013155 (2000), http:\/\/jgaa.info\/accepted\/00\/BrandesWagner00.4.3.pdf","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-36151-0_32","volume-title":"Graph Drawing","author":"C. Buchheim","year":"2002","unstructured":"Buchheim, C., J\u00fcnger, M., Leipert, S.: Improving Walker\u2019s algorithm to run in linear time. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 344\u2013353. Springer, Heidelberg (2002), doi:10.1007\/3-540-36151-0_32"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","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. Computational Geometry\u00a042(2), 173\u2013182 (2009), doi:10.1016\/j.comgeo.2008.05.003","journal-title":"Computational Geometry"},{"key":"17_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), doi:10.1007\/978-3-540-70904-6_9"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","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. Computational Geometry\u00a023(2), 153\u2013162 (2002), doi:10.1016\/S0925-7721(01)00066-9","journal-title":"Computational Geometry"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s004540010080","volume":"25","author":"C.C. 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.\u00a025(3), 405\u2013418 (2001), doi:10.1007\/s004540010080","journal-title":"Discrete Comput. Geom."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24595-7_1","volume-title":"Graph Drawing","author":"M. Dickerson","year":"2004","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.: Confluent drawings: visualizing non-planar diagrams in a planar way. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 1\u201312. Springer, Heidelberg (2004)"},{"issue":"5","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1142\/S0129054106004315","volume":"17","author":"C.A. Duncan","year":"2006","unstructured":"Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. Int. J. Found. Comput. Sci.\u00a017(5), 1143\u20131164 (2006), doi:10.1142\/S0129054106004315","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Drawing Trees with Perfect Angular Resolution and Polynomial Area, (September 2010) ArXiv e-prints, arXiv:1009.0581","DOI":"10.21236\/ADA530802"},{"key":"17_CR10","volume-title":"Proc. 18th Int. Symp. on Graph Drawing (GD 2010)","author":"C.A. Duncan","year":"2010","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi drawings of graphs. In: Proc. 18th Int. Symp. on Graph Drawing (GD 2010), Springer, Heidelberg (2010), http:\/\/arxiv.org\/abs\/1009.0579"},{"key":"17_CR11","first-page":"10","volume":"5","author":"P. Eades","year":"1992","unstructured":"Eades, P.: Drawing free trees. Bull. Inst. Combinatorics and Its Applications\u00a05, 10\u201336 (1992)","journal-title":"Bull. Inst. Combinatorics and Its Applications"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-31843-9_46","volume-title":"Graph Drawing","author":"B. Finkel","year":"2005","unstructured":"Finkel, B., Tamassia, R.: Curvilinear graph drawing using the force-directed method. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 448\u2013453. Springer, Heidelberg (2005)"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","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.\u00a06(3), 333\u2013356 (1996), http:\/\/www.cs.brown.edu\/cgc\/papers\/ggt-aoutd-96.ps.gz","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"17_CR14","doi-asserted-by":"publisher","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.\u00a013(6), 487\u2013505 (2003), doi:10.1142\/S021819590300130X","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00086","volume":"8","author":"A. Garg","year":"2004","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of binary trees with linear area and arbitrary aspect ratio. J. Graph Algorithms Appl.\u00a08(2), 135\u2013160 (2004), http:\/\/jgaa.info\/accepted\/2004\/GargRusu2004.8.2.pdf","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR16","first-page":"633","volume-title":"Proc. Int. Conf. Computer Vision and Graphics","author":"S. Grivet","year":"2004","unstructured":"Grivet, S., Auber, D., Domenger, J.P., Melan\u00e7on, G.: Bubble tree drawing algorithm. In: Proc. Int. Conf. Computer Vision and Graphics, pp. 633\u2013641. Springer, Heidelberg (2004), http:\/\/www.labri.fr\/publications\/is\/2004\/GADM04"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","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.\u00a013(2), 338\u2013355 (1984), doi:10.1137\/0213024","journal-title":"SIAM J. Comput."},{"key":"17_CR18","unstructured":"Hobbs, R., Lombardi, M.: Mark Lombardi: Global Networks. Independent Curators International, New York (2003)"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","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.\u00a011(2), 431\u2013452 (2007), http:\/\/jgaa.info\/accepted\/2007\/LinYen2007.11.2.pdf","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR20","unstructured":"Melan\u00e7on, G., Herman, I.: Circular Drawings of Rooted Trees. Tech. Rep. INS-R9817, CWI Amsterdam (1998)"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E.M. Reingold","year":"1981","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Trans. Software Engineering\u00a07(2), 223\u2013228 (1981)","journal-title":"IEEE Trans. Software Engineering"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Shin, C.-S., Kim, S.K., Chwa, K.-Y.: Area-efficient algorithms for straight-line tree drawings. Computational Geometry\u00a015(4), 175\u2013202 (2000), doi:10.1016\/S0925-7721(99)00053-X","DOI":"10.1016\/S0925-7721(99)00053-X"},{"issue":"7","key":"17_CR23","doi-asserted-by":"publisher","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. Software Practice and Experience\u00a020(7), 685\u2013705 (1990), doi:10.1002\/spe.4380200705","journal-title":"Software Practice and Experience"},{"issue":"5","key":"17_CR24","doi-asserted-by":"publisher","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. Software Engineering\u00a05(5), 514\u2013520 (1979)","journal-title":"IEEE Trans. Software Engineering"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T12:44:55Z","timestamp":1559997895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}