{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T14:03:46Z","timestamp":1726495426098},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_46","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"448-453","source":"Crossref","is-referenced-by-count":27,"title":["Curvilinear Graph Drawing Using the Force-Directed Method"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Finkel","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"JDSL: the data structures library in Java, \n                    \n                      http:\/\/jdsl.org"},{"key":"46_CR2","unstructured":"VGJ: Visualizing graphs with Java, \n                    \n                      http:\/\/www.eng.auburn.edu\/department\/cse\/research\/graphdrawing\/graphdrawing.html"},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0021792","volume-title":"Graph Drawing (Proc. GD 1995)","author":"F.J. Brandenburg","year":"1996","unstructured":"Brandenburg, F.J., Himsolt, M., Rohrer, C.: An experimental comparison of force-directed and randomized graph drawing algorithms. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 76\u201387. Springer, Heidelberg (1996)"},{"key":"46_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 2000), pp. 23\u201332 (2000)","DOI":"10.1007\/978-3-7091-6783-0_3"},{"key":"46_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-44541-2_12","volume-title":"Graph Drawing","author":"U. Brandes","year":"2001","unstructured":"Brandes, U., Shubina, G., Tamassia, R., Wagner, D.: Fast layout methods for timetable graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 127\u2013138. Springer, Heidelberg (2001)"},{"key":"46_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)"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-46648-7_12","volume-title":"Graph Drawing","author":"C.C. Cheng","year":"1999","unstructured":"C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Drawing planar graphs with circular arcs. In Graph Drawing (Proc. GD 1999), LNCS 1731, pp. 117\u2013126, 1999."},{"issue":"4","key":"46_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing graphics nicely using simulated annealing. ACM Trans. Graph.\u00a015(4), 301\u2013331 (1996)","journal-title":"ACM Trans. Graph."},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-63938-1_68","volume-title":"Graph Drawing","author":"D.P. Dobkin","year":"1997","unstructured":"Dobkin, D.P., Gansner, E.R., Koutsofios, E., North, S.C.: Implementing a general-purpose edge router. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 262\u2013271. Springer, Heidelberg (1997)"},{"key":"46_CR10","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congr. Numer.\u00a042, 149\u2013160 (1984)","journal-title":"Congr. Numer."},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-58950-3_393","volume-title":"Graph Drawing","author":"A. Frick","year":"1995","unstructured":"Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 388\u2013403. Springer, Heidelberg (1995)"},{"issue":"11","key":"46_CR12","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"Fruchterman, T., Reingold, E.: Graph drawing by force-directed placement. Softw. \u2013 Pract. Exp.\u00a021(11), 1129\u20131164 (1991)","journal-title":"Softw. \u2013 Pract. Exp."},{"key":"46_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44541-2_20","volume-title":"Graph Drawing","author":"P. Gajer","year":"2001","unstructured":"Gajer, P., Goodrich, M.T., Kobourov, S.G.: A fast multi-dimensional algorithm for drawing large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 211\u2013221. Springer, Heidelberg (2001)"},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E.R. Gansner","year":"1993","unstructured":"Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.P.: A technique for drawing directed graphs. IEEE Trans. Softw. Eng.\u00a019, 214\u2013230 (1993)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"11","key":"46_CR15","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"18","author":"E.R. Gansner","year":"1988","unstructured":"Gansner, E.R., North, S.C., Vo, K.P.: DAG \u2013 A program that draws directed graphs. Softw. \u2013 Pract. Exp.\u00a018(11), 1047\u20131062 (1988)","journal-title":"Softw. \u2013 Pract. Exp."},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-62495-3_48","volume-title":"Graph Drawing","author":"A. Garg","year":"1997","unstructured":"Garg, A., Tamassia, R.: GIOTTO3D: A system for visualizing hierarchical structures in 3D. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 193\u2013200. Springer, Heidelberg (1997)"},{"key":"46_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-37623-2_12","volume-title":"Graph Drawing","author":"M.T. Goodrich","year":"1999","unstructured":"Goodrich, M.T., Wagner, C.G.: A framework for drawing planar graphs with curves and polylines. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 153\u2013166. Springer, Heidelberg (1999)"},{"key":"46_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)"},{"key":"46_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36151-0_20","volume-title":"Graph Drawing","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: Graph drawing by high-dimensional embedding. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 207\u2013219. Springer, Heidelberg (2002)"},{"key":"46_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inform. Process. Lett.\u00a031, 7\u201315 (1989)","journal-title":"Inform. Process. Lett."},{"key":"46_CR21","doi-asserted-by":"crossref","unstructured":"Munzner, T., Hoffman, E., Claffy, K., Fenner, B.: Visualizing the global topology of the MBone. In: Proc. IEEE Symp. on Information Visualization, pp. 85\u201392 (1996)","DOI":"10.1109\/INFVIS.1996.559226"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:42:03Z","timestamp":1620013323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}