{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:22:39Z","timestamp":1746249759772,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/vlhcc.2011.6070402","type":"proceedings-article","created":{"date-parts":[[2011,11,7]],"date-time":"2011-11-07T20:24:20Z","timestamp":1320697460000},"page":"213-216","source":"Crossref","is-referenced-by-count":5,"title":["Aesthetic of angular resolution for node-link diagrams: Validation and algorithm"],"prefix":"10.1109","author":[{"family":"Weidong Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Maolin Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Chun-Cheng Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref11","article-title":"A steady state model for graph power laws","author":"eppstein","year":"2002","journal-title":"Proceedings of the International Workshop on Web Dynamics"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On Random Graphs","volume":"6","author":"erdos","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1511\/2000.2.104"},{"key":"ref14","first-page":"51","article-title":"How people read graphs","author":"huang","year":"2005","journal-title":"Proc APVis '05"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70904-6_3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/VLHCC.2010.32"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvlc.2009.04.007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.67"},{"key":"ref8","first-page":"448","article-title":"Curvilinear graph drawing using the force-directed method","author":"finkel","year":"2004","journal-title":"Proc GD '04"},{"key":"ref7","first-page":"329","article-title":"A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion","author":"lin","year":"2005","journal-title":"Proc of IV'05"},{"journal-title":"Graph Drawing Algorithms for the Visualization of Graphs","year":"1998","author":"di battista","key":"ref2"},{"key":"ref1","first-page":"651","article-title":"Applying Graphical Design Techniques to Graph Visualization","author":"taylor","year":"2005","journal-title":"Proc of IV'05"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"}],"event":{"name":"2011 IEEE Symposium on Visual Languages and Human-Centric Computing (VL\/HCC 2011)","start":{"date-parts":[[2011,9,18]]},"location":"Pittsburgh, PA","end":{"date-parts":[[2011,9,22]]}},"container-title":["2011 IEEE Symposium on Visual Languages and Human-Centric Computing (VL\/HCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6059237\/6070364\/06070402.pdf?arnumber=6070402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T23:55:45Z","timestamp":1686441345000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6070402\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/vlhcc.2011.6070402","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}