{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:23:39Z","timestamp":1760441019967},"publisher-location":"Berlin, Heidelberg","reference-count":28,"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_31","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"320-331","source":"Crossref","is-referenced-by-count":15,"title":["Force-Directed Lombardi-Style Graph Drawing"],"prefix":"10.1007","author":[{"given":"Roman","family":"Chernobelskiy","sequence":"first","affiliation":[]},{"given":"Kathryn I.","family":"Cunningham","sequence":"additional","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Lowell","family":"Trott","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-62495-3_39","volume-title":"Graph Drawing","author":"F. Brandenburg","year":"1997","unstructured":"Brandenburg, F., Himsolt, M., Rohrer, C.: An Experimental Comparison of Force-Directed And Randomized Graph Drawing Algorithms. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 76\u201387. Springer, Heidelberg (1997)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-44969-8_4","volume-title":"Drawing Graphs","author":"U. Brandes","year":"2001","unstructured":"Brandes, U.: Drawing on Physical Analogies. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol.\u00a02025, pp. 71\u201386. Springer, Heidelberg (2001)"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-70904-6_7","volume-title":"Graph Drawing","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Schlieper, B.: Angle and Distance Constraints On Tree Drawings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 54\u201365. Springer, Heidelberg (2007)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Brandes, U., Shubina, G., Tamassia, R.: Improving angular resolution in visualizations of geographic networks. In: 2nd TCVG Symp. Visualization, pp. 23\u201332 (2000)","DOI":"10.1007\/978-3-7091-6783-0_3"},{"issue":"3","key":"31_CR5","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)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"31_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)","journal-title":"Discrete Comput. Geom."},{"key":"31_CR7","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1998","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, Upper Saddle River (1998)"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discrete Math.\u00a09(3), 349\u2013359 (1996)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","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.Y.: Confluent drawings: Visualizing non-planar diagrams in a planar way. J. Graph Algorithms Appl.\u00a09(1), 31\u201352 (2005)","journal-title":"J. Graph Algorithms Appl."},{"key":"31_CR10","series-title":"LNCS","first-page":"308","volume-title":"GD 2011","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., L\u00f6ffler, M.: Planar and Poly-Arc Lombardi Drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 308\u2013319. Springer, Heidelberg (2011)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-18469-7_17","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2011","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: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 183\u2013194. Springer, Heidelberg (2011)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-18469-7_18","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi Drawings of Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 195\u2013207. Springer, Heidelberg (2011)"},{"key":"31_CR13","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium\u00a042, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"issue":"4","key":"31_CR14","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00453-006-0159-8","volume":"47","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. Algorithmica\u00a047(4), 439\u2013452 (2007)","journal-title":"Algorithmica"},{"key":"31_CR15","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":"11","key":"31_CR16","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."},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2004.03.014","volume":"29","author":"P. Gajer","year":"2004","unstructured":"Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. Comp.\u00a0Geometry: Theory and Applications\u00a029(1), 3\u201318 (2004)","journal-title":"Comp.\u00a0Geometry: Theory and Applications"},{"issue":"3","key":"31_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.7155\/jgaa.00052","volume":"6","author":"P. Gajer","year":"2002","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: Graph dRawing with Intelligent Placement. Journal of Graph Algorithms and Applications\u00a06(3), 203\u2013224 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Garg, A., Tamassia, R.: Planar drawings and angular resolution: algorithms and bounds. In: 2nd European Symposium on Algorithms, London, UK, pp. 12\u201323 (1994)","DOI":"10.1007\/BFb0049393"},{"issue":"2","key":"31_CR20","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1006\/jagm.2000.1115","volume":"37","author":"M.T. Goodrich","year":"2000","unstructured":"Goodrich, M.T., Wagner, C.G.: A framework for drawing planar graphs with curves and polylines. J. Algorithms\u00a037(2), 399\u2013421 (2000)","journal-title":"J. Algorithms"},{"key":"31_CR21","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":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-70904-6_39","volume-title":"Graph Drawing","author":"M. Hirsch","year":"2007","unstructured":"Hirsch, M., Meijer, H., Rappaport, D.: Biclique Edge Cover Graphs and Confluent Drawings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 405\u2013416. Springer, Heidelberg (2007)"},{"key":"31_CR23","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, 983\u2013990 (2009)","journal-title":"Computer Graphics Forum"},{"key":"31_CR24","unstructured":"Lombardi, M., Hobbs, R.: Mark Lombardi: Global Networks. Independent Curators (2003)"},{"issue":"2","key":"31_CR25","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895480193242931","volume":"7","author":"S. Malitz","year":"1994","unstructured":"Malitz, S., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete Math.\u00a07(2), 172\u2013183 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"31_CR26","unstructured":"Matsakis, N.: Transforming a random graph drawing into a Lombardi drawing. arXiv ePrints, abs\/1012.2202 (2010)"},{"key":"31_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H. Purchase","year":"1997","unstructured":"Purchase, H.: Which Aesthetic Has The Greatest Effect On Human Understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 248\u2013261. Springer, Heidelberg (1997)"},{"key":"31_CR28","series-title":"Lecture Notes in Computer Science","first-page":"435","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1997","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating Graph Drawing Aesthetics. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 435\u2013446. Springer, Heidelberg (1997)"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T21:05:50Z","timestamp":1555880750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}