{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:16:34Z","timestamp":1762917394006},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Visual Languages & Computing"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1016\/j.jvlc.2011.12.001","type":"journal-article","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T04:16:55Z","timestamp":1323836215000},"page":"29-42","source":"Crossref","is-referenced-by-count":21,"title":["A new force-directed graph drawing method based on edge\u2013edge repulsion"],"prefix":"10.1016","volume":"23","author":[{"given":"Chun-Cheng","family":"Lin","sequence":"first","affiliation":[]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/j.jvlc.2011.12.001_bib1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0020-0190(00)00042-9","article-title":"A force-directed algorithm that preserves edge-crossing properties","volume":"74","author":"Bertault","year":"2000","journal-title":"Information Processing Letters"},{"issue":"5","key":"10.1016\/j.jvlc.2011.12.001_bib2","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1109\/3477.718522","article-title":"An analytically tractable potential field model of free space and its application in obstacle avoidance","volume":"28","author":"Chuang","year":"1998","journal-title":"IEEE Transactions on System, Man, and Cybernetics"},{"key":"10.1016\/j.jvlc.2011.12.001_bib3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/234535.234538","article-title":"Drawing graphs nicely using simulated annealing","volume":"15","author":"Davidson","year":"1996","journal-title":"ACM Transactions on Graphics"},{"key":"10.1016\/j.jvlc.2011.12.001_bib4","first-page":"149","article-title":"A heuristic for graph drawing","volume":"42","author":"Eades","year":"1984","journal-title":"Congress Numerantium"},{"issue":"2","key":"10.1016\/j.jvlc.2011.12.001_bib5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0304-3975(99)00239-X","article-title":"Spring algorithms and symmetry","volume":"240","author":"Eades","year":"2000","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"10.1016\/j.jvlc.2011.12.001_bib6","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/0222063","article-title":"Drawing graphs in the plane with high resolution","volume":"22","author":"Formann","year":"1993","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.jvlc.2011.12.001_bib7","first-page":"388","article-title":"A fast adaptive layout algorithm for undirected graphs","volume":"vol. 894","author":"Frick","year":"1995"},{"issue":"6","key":"10.1016\/j.jvlc.2011.12.001_bib8","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.1109\/TVCG.2007.70580","article-title":"Multi-level graph layout on the GPU","volume":"13","author":"Frishman","year":"2007","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"3","key":"10.1016\/j.jvlc.2011.12.001_bib9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.jvlc.2007.07.006","article-title":"MOVIS: a system for visualizing distributed mobile object environments","volume":"19","author":"Frishman","year":"2008","journal-title":"Journal of Visual Languages and Computing"},{"issue":"4","key":"10.1016\/j.jvlc.2011.12.001_bib10","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1109\/TVCG.2008.11","article-title":"Online dynamic graph drawing","volume":"14","author":"Frishman","year":"2008","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"10.1016\/j.jvlc.2011.12.001_bib11","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","article-title":"Graph drawing by force-directed placement","volume":"21","author":"Fruchterman","year":"1991","journal-title":"Software\u2014Practice and Experience"},{"issue":"1","key":"10.1016\/j.jvlc.2011.12.001_bib12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.comgeo.2004.03.014","article-title":"A multi-dimensional approach to force-directed layouts of large graphs","volume":"29","author":"Gajer","year":"2004","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/j.jvlc.2011.12.001_bib13","first-page":"285","article-title":"Drawing large graphs with a potential-field-based multilevel algorithm","volume":"vol. 3383","author":"Hachul","year":"2005"},{"issue":"2","key":"10.1016\/j.jvlc.2011.12.001_bib14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.7155\/jgaa.00150","article-title":"Large-graph layout algorithms at work: an experimental study","volume":"11","author":"Hachul","year":"2007","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"3","key":"10.1016\/j.jvlc.2011.12.001_bib15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.7155\/jgaa.00051","article-title":"A fast multi-scale method for drawing large graphs","volume":"6","author":"Harel","year":"2002","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"3","key":"10.1016\/j.jvlc.2011.12.001_bib16","first-page":"303","article-title":"Automatic visualisation of metro maps","volume":"19","author":"Hong","year":"2008","journal-title":"Journal of Visual Languages and Computing"},{"issue":"6","key":"10.1016\/j.jvlc.2011.12.001_bib17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1006\/jvlc.1998.0094","article-title":"On-line animated visualization of huge graphs using a modified spring algorithm","volume":"9","author":"Huang","year":"1998","journal-title":"Journal of Visual Languages and Computing"},{"key":"10.1016\/j.jvlc.2011.12.001_bib18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","article-title":"An algorithm for drawing general undirected graphs","volume":"31","author":"Kamada","year":"1989","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.jvlc.2011.12.001_bib19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"6","key":"10.1016\/j.jvlc.2011.12.001_bib20","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/TVCG.2005.103","article-title":"Non-Euclidean spring embedders","volume":"11","author":"Kobourov","year":"2005","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"5","key":"10.1016\/j.jvlc.2011.12.001_bib21","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1109\/TVCG.2006.193","article-title":"Visual exploration of complex time-varying graphs","volume":"12","author":"Kumar","year":"2006","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"6","key":"10.1016\/j.jvlc.2011.12.001_bib22","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.jvlc.2009.04.006","article-title":"Drawing graphs with nonuniform nodes using potential fields","volume":"20","author":"Lin","year":"2009","journal-title":"Journal of Visual Languages and Computing"},{"issue":"2","key":"10.1016\/j.jvlc.2011.12.001_bib23","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","article-title":"Layout adjustment and the mental map","volume":"6","author":"Misue","year":"1995","journal-title":"Journal of Visual Languages and Computing"},{"issue":"5","key":"10.1016\/j.jvlc.2011.12.001_bib24","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","article-title":"Metrics for graph drawing aesthetics","volume":"13","author":"Purchase","year":"2002","journal-title":"Journal of Visual Languages and Computing"},{"key":"10.1016\/j.jvlc.2011.12.001_bib25","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jvlc.1995.1013","article-title":"Graph drawing by the magnetic spring model","volume":"6","author":"Sugiyama","year":"1995","journal-title":"Journal of Visual Languages and Computing"},{"key":"10.1016\/j.jvlc.2011.12.001_bib26","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","article-title":"Convex representations of graphs","volume":"10","author":"Tutte","year":"1960","journal-title":"Proceedings of the London Mathematical Society"},{"key":"10.1016\/j.jvlc.2011.12.001_bib27","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","article-title":"How to draw a graph","volume":"13","author":"Tutte","year":"1963","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"3","key":"10.1016\/j.jvlc.2011.12.001_bib28","doi-asserted-by":"crossref","first-page":"253","DOI":"10.7155\/jgaa.00070","article-title":"A multilevel algorithm for force-directed graph-drawing","volume":"7","author":"Walshaw","year":"2003","journal-title":"Journal of Graph Algorithms and Applications"}],"container-title":["Journal of Visual Languages & Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1045926X11000802?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1045926X11000802?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T20:32:47Z","timestamp":1543350767000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1045926X11000802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["S1045926X11000802"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.jvlc.2011.12.001","relation":{},"ISSN":["1045-926X"],"issn-type":[{"value":"1045-926X","type":"print"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}