{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:05:29Z","timestamp":1767182729243},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_13","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"123-135","source":"Crossref","is-referenced-by-count":15,"title":["TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance"],"prefix":"10.1007","author":[{"given":"Quan","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"jFlowMap (2010), \n                    \n                      http:\/\/code.google.com\/p\/jflowmap\/","key":"13_CR1"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/11618058_42","volume-title":"Graph Drawing","author":"A. Ahmed","year":"2006","unstructured":"Ahmed, A., Dwyer, T., Forster, M., Fu, X., Ho, J., Hong, S.-H., Kosch\u00fctzki, D., Murray, C., Nikolov, N.S., Taib, R., Tarassov, A., Xu, K.: GEOMI: Geometry for Maximum Insight. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 468\u2013479. Springer, Heidelberg (2006), \n                    \n                      http:\/\/dblp.uni-trier.de\/db\/conf\/gd\/gd2005.html#AhmedDFFHHKMNTTX05"},{"unstructured":"Alvarez, H.J.I., Dall, A.L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: Advances in Neural Information Processing Systems, vol.\u00a018, p. 41 (2006)","key":"13_CR3"},{"doi-asserted-by":"crossref","unstructured":"Balzer, M., Deussen, O.: Level-of-detail visualization of clustered graph layouts. In: APVIS, pp. 133\u2013140 (2007)","key":"13_CR4","DOI":"10.1109\/APVIS.2007.329288"},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/b106453","volume-title":"Network analysis: methodological foundations","author":"U. Brandes","year":"2005","unstructured":"Brandes, U., Erlebach, T.: Network analysis: methodological foundations. Springer, Heidelberg (2005)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-37623-2_4","volume-title":"Graph Drawing","author":"U. Brandes","year":"1999","unstructured":"Brandes, U., Wagner, D.: Using Graph Layout to Visualize Train Interconnection Data. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 44\u201356. Springer, Heidelberg (1999)"},{"issue":"12","key":"13_CR7","doi-asserted-by":"publisher","first-page":"2252","DOI":"10.1016\/j.jss.2008.02.068","volume":"81","author":"B. Cornelissen","year":"2008","unstructured":"Cornelissen, B., Zaidman, A., Holten, D., Moonen, L., van Deursen, A., van Wijk, J.J.: Execution trace analysis through massive sequence and circular bundle views. Journal of Systems and Software\u00a081(12), 2252\u20132268 (2008)","journal-title":"Journal of Systems and Software"},{"doi-asserted-by":"crossref","unstructured":"Cui, W., Zhou, H., Qu, H., Wong, P.C., Li, X.: Geometry-based edge clustering for graph visualization. IEEE Transactions on Visualization and Computer Graphics, 1277\u20131284 (2008)","key":"13_CR8","DOI":"10.1109\/TVCG.2008.135"},{"key":"13_CR9","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)"},{"doi-asserted-by":"crossref","unstructured":"Gansner, E., Hu, Y., North, S., Scheidegger, C.: Multilevel agglomerative edge bundling for visualizing large graphs. In: IEEE PacificVis, pp. 187\u2013194 (2011)","key":"13_CR10","DOI":"10.1109\/PACIFICVIS.2011.5742389"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"E. Gansner","year":"2007","unstructured":"Gansner, E., Koren, Y.: Improved Circular Layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 386\u2013398. Springer, Heidelberg (2007)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/11618058_44","volume-title":"Graph Drawing","author":"J. Ho","year":"2006","unstructured":"Ho, J., Hong, S.-H.: Drawing Clustered Graphs in Three Dimensions. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 492\u2013502. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Holten, D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 741\u2013748 (2006)","key":"13_CR13","DOI":"10.1109\/TVCG.2006.147"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D. Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Computer Graphics Forum\u00a028(3), 983\u2013990 (2009)","journal-title":"Computer Graphics Forum"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1111\/j.1467-8659.2009.01700.x","volume":"29","author":"A. Lambert","year":"2010","unstructured":"Lambert, A., Bourqui, R., Auber, D.: Winding roads: Routing edges into bundles. Computer Graphics Forum\u00a029, 853\u2013862 (2010)","journal-title":"Computer Graphics Forum"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-18469-7_30","volume-title":"Graph Drawing","author":"S. Pupyrev","year":"2011","unstructured":"Pupyrev, S., Nachmanson, L., Kaufmann, M.: Improving Layered Graph Layouts with Edge Bundling. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 329\u2013340. Springer, Heidelberg (2011)"},{"unstructured":"Strzodka, R., Telea, A.: Generalized distance transforms and skeletons in graphics hardware. In: VisSym, pp. 221\u2013230 (2004)","key":"13_CR17"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jvlc.1995.1013","volume":"6","author":"K. Sugiyama","year":"1995","unstructured":"Sugiyama, K., Misue, K.: Graph drawing by the magnetic spring model. Journal of Visual Languages and Computing\u00a06(3), 217\u2013231 (1995)","journal-title":"Journal of Visual Languages and Computing"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1111\/j.1467-8659.2009.01680.x","volume":"29","author":"A. Telea","year":"2010","unstructured":"Telea, A., Ersoy, O.: Image-Based Edge Bundles: Simplified Visualization of Large Graphs. Computer Graphics Forum\u00a029, 843\u2013852 (2010)","journal-title":"Computer Graphics Forum"},{"doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K.: Social network analysis: Methods and applications, 1st edn. Cambridge University Press (1994)","key":"13_CR20","DOI":"10.1017\/CBO9780511815478"},{"doi-asserted-by":"crossref","unstructured":"Zhou, H., Yuan, X., Cui, W., Qu, H., Chen, B.: Energy-based hierarchical edge clustering of graphs. In: IEEE PacificVis, pp. 55\u201361 (2008)","key":"13_CR21","DOI":"10.1109\/PACIFICVIS.2008.4475459"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:38:22Z","timestamp":1555879102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}