Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuang, Weidongen_US
dc.contributor.authorHuang, Maolinen_US
dc.contributor.authorLin, Chun-Chengen_US
dc.date.accessioned2017-04-21T06:50:01Z-
dc.date.available2017-04-21T06:50:01Z-
dc.date.issued2011en_US
dc.identifier.isbn978-1-4577-1245-6en_US
dc.identifier.issn1943-6092en_US
dc.identifier.urihttp://hdl.handle.net/11536/134822-
dc.description.abstractWhen visualizing graphs into node-link diagrams, angular resolution is often used as one of the aesthetic criteria measuring the diagram quality in terms of human comprehension. However, angular resolution has not been empirically validated for its relevance to humans. In addition, although many force-directed algorithms have been proposed for automatic graph drawing, performance evaluation of these algorithms has not been conclusive due to the lack of proper methods. To shorten these gaps, this paper 1) validates the aesthetic based on human experimental data and identifies the best of angular resolution measures used in the literature; 2) introduces a force-directed algorithm, forceAR, for improving angular resolution; 3) proposes a new framework for more reliable and thorough evaluation of force-directed algorithms. Finally as a case study, our forceAR algorithm is evaluated using this framework.en_US
dc.language.isoen_USen_US
dc.subjectnode-link diagramen_US
dc.subjectgraph drawingen_US
dc.subjectaestheticsen_US
dc.subjectangular resolutionen_US
dc.subjectforce-directed algorithmen_US
dc.subjectevaluationen_US
dc.titleAesthetic of Angular Resolution for Node-Link Diagrams: Validation and Algorithmen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2011 IEEE SYMPOSIUM ON VISUAL LANGUAGES AND HUMAN-CENTRIC COMPUTING (VL/HCC 2011)en_US
dc.citation.spage213en_US
dc.citation.epage216en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.identifier.wosnumberWOS:000299283500034en_US
dc.citation.woscount2en_US
Appears in Collections:Conferences Paper