dc.contributor.author | Welch, Eric | en_US |
dc.contributor.author | Kobourov, Stephen | en_US |
dc.contributor.editor | Heer, Jeffrey and Ropinski, Timo and van Wijk, Jarke | en_US |
dc.date.accessioned | 2017-06-12T05:22:49Z | |
dc.date.available | 2017-06-12T05:22:49Z | |
dc.date.issued | 2017 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.uri | http://dx.doi.org/10.1111/cgf.13192 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13192 | |
dc.description.abstract | Layout symmetry is an important and desired feature in graph drawing. While there is a substantial body of work in computer vision around the detection and measurement of symmetry in images, there has been little effort to define and validate meaningful measures of the symmetry of graph drawings. In this paper, we evaluate two algorithms that have been proposed for measuring graph drawing symmetry, comparing their judgments to those of human subjects, and investigating the use of stress as an alternative measure of symmetry. We discuss advantages and disadvantages of these measures, possible ways to improve them, and implications for the design of algorithms that optimize the symmetry in the layout. | en_US |
dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.title | Measuring Symmetry in Drawings of Graphs | en_US |
dc.description.seriesinformation | Computer Graphics Forum | |
dc.description.sectionheaders | Visual Encoding Analysis | |
dc.description.volume | 36 | |
dc.description.number | 3 | |
dc.identifier.doi | 10.1111/cgf.13192 | |
dc.identifier.pages | 341-351 | |