{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:24:53Z","timestamp":1742379893484},"publisher-location":"Dordrecht","reference-count":18,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402041785"},{"type":"electronic","value":"9781402041792"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/1-4020-4179-9_91","type":"book-chapter","created":{"date-parts":[[2006,3,10]],"date-time":"2006-03-10T18:01:35Z","timestamp":1142013695000},"page":"633-641","source":"Crossref","is-referenced-by-count":21,"title":["BUBBLE TREE DRAWING ALGORITHM"],"prefix":"10.1007","author":[{"given":"S.","family":"Grivet","sequence":"first","affiliation":[]},{"given":"D.","family":"Auber","sequence":"additional","affiliation":[]},{"given":"J. P.","family":"Domenger","sequence":"additional","affiliation":[]},{"given":"G.","family":"Melancon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"91_CR1","doi-asserted-by":"crossref","unstructured":"Amenta, N. and Klingner, J. (2002). Case study: Visualizing sets of evolutionary trees. In IEEE Infovis'02, pages 71\u201376.","DOI":"10.1109\/INFVIS.2002.1173150"},{"key":"91_CR2","unstructured":"Auber, D. (2001). Tulip. In Mutzel, P., J\u00fcnger, M., and Leipert, S., editors, 9th Symp. Graph Drawing, volume 2265 of Lecture Notes in Computer Science, pages 335\u2013337. Springer-Verlag."},{"key":"91_CR3","unstructured":"Auber, D. (2003). Graph Drawing Softwares, chapter Tulip- A Huge Graphs Visualization Framework, pages 80\u2013102. Mathematics and Visualization series. Springer-Verlag."},{"key":"91_CR4","unstructured":"Battista, G., Eades, P., Tamassia, R., Tollis, I., and Tollis, G. (1999). Graph Drawing : Algorithms for the Visualization of Graphs. Prentice-Hall."},{"key":"91_CR5","doi-asserted-by":"crossref","unstructured":"Bruls, D. M., Huizing, C., and VanWijk, J. J. (2000). Squarified treemaps. In Data Visualization 2000, Proceedings of the joint Eurographics and IEEE TCVG Symposium on Visualization, pages 33\u201342. Springer.","DOI":"10.1007\/978-3-7091-6783-0_4"},{"key":"91_CR6","doi-asserted-by":"crossref","unstructured":"Buchheim, C., J\u00fcnger, M., and Leipert, S. (2002). Improving walker\u2019s algorithm to run in linear time. Technical report, Zentrum f\u00fcr Angewandte Informatik Koln, Lehrstuhl Junger.","DOI":"10.1007\/3-540-36151-0_32"},{"key":"91_CR7","first-page":"74","volume-title":"IEEE Symposium on Information Visualization","author":"J. Carriere","year":"1995","unstructured":"Carriere, J. and Kazman, R. (1995). Interacting with huge hierarchies: Beyond cone trees. In G. and Eick, S., editors, IEEE Symposium on Information Visualization, pages 74\u201378. Atlanta, Georgia Institute for Electrical and Electronics Engineers."},{"key":"91_CR8","first-page":"10","volume":"5","author":"P. Eades","year":"1992","unstructured":"Eades, P. (1992). Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications, 5:10\u201336.","journal-title":"Bulletin of the Institute for Combinatorics and its Applications"},{"key":"91_CR9","unstructured":"Freund, R. M., Sun, J., and Xu, S. (2003). Solution methodologies for the smallest enclosing circle problem. Computational Optimization and Applications, 24\u201326."},{"key":"91_CR10","unstructured":"Jeon, C. S. and Pang, A. (1998). Reconfigurable disc trees for visualizing large hierarchical information space. In IEEE InfoVis\u201998, pages 19\u201325."},{"key":"91_CR11","unstructured":"Knuth, D. E. (1973). The Art of Computer Programming, volume 1. Addison-Wesley."},{"key":"91_CR12","doi-asserted-by":"crossref","unstructured":"Munzner, T. (1997). H3: laying out large directed graphs in 3d hyperbolic space. In IEEE Infovis'97, pages 2\u201310.","DOI":"10.1109\/INFVIS.1997.636718"},{"issue":"2","key":"91_CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E. M. Reingold","year":"1981","unstructured":"Reingold, E. M. and Tilford, J. S. (1981). Tidier drawings of trees. IEEE Transactions on Software Engineering, 7(2):223\u2013228.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"91_CR14","doi-asserted-by":"crossref","unstructured":"Robertson, G. G., Mackinlay, J. D., and Card, S. K. (1991). Cone trees: Animated 3d visualizations of hierarchical information. In SIGCHI, Conference on Human Factors in Computing Systems, pages 189\u2013194. ACM.","DOI":"10.1145\/108844.108883"},{"key":"91_CR15","unstructured":"Shneiderman, B. (1991). Tree visualization with tree-maps : A 2-d space filling approach. In ACM Transaction on graphics, pages 92\u201399."},{"key":"91_CR16","doi-asserted-by":"crossref","unstructured":"Teoh, Soon Tee and Ma, Kwan Liu (2002). Rings: A technique for visualizing large hierarchies. In Kobourov, S. G. and Goodrich, M. T., editors, Graph Drawing, volume 2528 of Lecture Notes in Computer Science, pages 268\u2013275. Springer.","DOI":"10.1007\/3-540-36151-0_25"},{"key":"91_CR17","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"J. Q. Walker","year":"1990","unstructured":"Walker, J. Q. (1990). A node positioning algorithm for general trees. Software Practice and Experience, 20:685\u2013705.","journal-title":"Software Practice and Experience"},{"key":"91_CR18","doi-asserted-by":"crossref","unstructured":"Welzl, E. (1991). Smallest enclosing disks (balls and ellipsoids). In Maurer, Hermann A., editor, New Results and New Trends in Computer Science, Lecture Notes in Computer Science, 555. Springer-Verlag.","DOI":"10.1007\/BFb0038202"}],"container-title":["Computational Imaging and Vision","Computer Vision and Graphics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-4179-9_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T15:03:40Z","timestamp":1558191820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-4179-9_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9781402041785","9781402041792"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/1-4020-4179-9_91","relation":{},"ISSN":["1381-6446"],"issn-type":[{"type":"print","value":"1381-6446"}],"subject":[],"published":{"date-parts":[[2006]]}}}