research-article

Exploring the relative importance of crossing number and crossing angle

Authors:

Maolin HuangAuthors Info & Claims

VINCI '10: Proceedings of the 3rd International Symposium on Visual Information Communication

Article No.: 10, Pages 1 - 8

https://doi.org/10.1145/1865841.1865854

Published: 28 September 2010 Publication History

Abstract

Recent research has indicated that human graph reading performance can be affected by the size of crossing angle. Crossing angle is closely related to another aesthetic criterion: number of edge crossings. Although crossing number has been previously identified as the most important aesthetic, its relative impact on performance of human graph reading is unknown, compared to crossing angle. In this paper, we present an exploratory user study investigating the relative importance between crossing number and crossing angle. This study also aims to further examine the effects of crossing number and crossing angle not only on task performance measured as response time and accuracy, but also on cognitive load and visualization efficiency. The experimental results reinforce the previous findings of the effects of the two aesthetics on graph comprehension. The study demonstrates that on average these two closely related aesthetics together explain 33% of variance in the four usability measures: time, accuracy, mental effort and visualization efficiency, with about 38% of the explained variance being attributed to the crossing angle.

References

[1]

}}Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M. and Symvonis, A. (2009) On the Perspectives Opened by Right Angle Crossing Drawings. In Proc. 17th International Symposium on Graph Drawing(GD'09), LNCS 5849, 21--32.

Digital Library

[2]

}}Brandes, U. (2001) Drawing on Physical Analogies. In Michael Kaufmann and Dorothea Wagner (Eds.): Drawing Graphs: Methods and Models. LNCS Tutorial 2025, 71--86.

Digital Library

[3]

}}Di Battista, G., Eades, P., Tamassia, R. and Tollis, I. (1998) Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall.

Digital Library

[4]

}}Didimo, W., Eades, P. and Liotta, G. (2009) Drawing Graphs with Right Angle Crossings. In Proc. International Symposium on Algorithms and Data Structures, 206--217.

Digital Library

[5]

}}Di Giacomo, E., Didimo, W., Liotta, G. and Meijer, H. (2009) Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. In Proc. 17th International Symposium on Graph Drawing(GD'09), LNCS 5849, 15--20.

Digital Library

[6]

}}Dujmovic, V., Gudmundsson, J., Morin, P. and Wolle, T. (2010) Notes on Large Angle Crossing Graphs. In Proc. Computing: the Australasian Theory Symposium.

Digital Library

[7]

}}Dunne, C. and Shneiderman, B. (2009) Improving graph drawing readability by incorporating readability metrics: a software tool for network analysts. Technical Report HCIL-2009-13, University of Maryland.

[8]

}}Dwyer, T., Lee, B., Fisher, D., Quinn, K. I., Isenberg, P., Robertson, G. and North, C. (2009) A Comparison of User-Generated and Automatic Graph Layouts. IEEE Transactions on Visualization and Computer Graphics, 15(6): 961--968.

Digital Library

[9]

}}Eades, P., Hong, S.-H. and Poon, S.-H. (2009) On Rectilinear Drawing of Graphs. In Proc. 17th International Symposium on Graph Drawing(GD'09), LNCS 5849, 232--243.

Digital Library

[10]

}}Eades, P., Huang W. and Hong, S.-H. (2009) A Force-Directed Method for Large Crossing Angle Graph Drawing. Technical Report Number 640, University of Sydney.

[11]

}}Garey, M. R. and Johnson, D. S. (1983) Crossing Number is NP-Complete. SIAM Journal on Algebraic and Discrete Methods, 4: 312--316.

[12]

}}Huang, W., Eades, P. and Hong, S.-H (2009) Measuring Effectiveness of Graph Visualizations: A Cognitive Load Approach. Information Visualization, 8(3):139--152.

Digital Library

[13]

}}Huang, W., Hong, S.-H. and Eades, P. (2006) Predicting graph reading performance: a cognitive approach. In Proc. Asia-Pacific Symposium on information Visualisation (APVIS'06), 207--216.

Digital Library

[14]

}}Huang, W., Hong, S.-H. and Eades, P. (2008) Effects of Crossing Angles. In Proc. the IEEE Pacific Visualization Symposium 2008(Pacific Vis'08), 41--46.

[15]

}}Huang, W., Hong, S.-H. and Eades, P. (2005) Layout Effects on Sociogram Perception. In Proc. 13th International Symposium on Graph Drawing(GD'05), LNCS 3843, 262--273.

Digital Library

[16]

}}Huang, W. (2007) Using Eye Tracking to Investigate Graph Layout Effects. In Proc. Asia Pacific Symposium on Visualization (APVIS'07), 97--100.

[17]

}}Keith, T. (2005) Multiple Regression and Beyond. Allyn & Bacon.

[18]

}}Korner, C. and Albert, D. (2002) Speed of Comprehension of Visualized Ordered Sets. Journal of Experimental Psychology: Applied, 8: 57--71.

[19]

}}Mutzel, P. (1997) An Alternative Method to Crossing Minimization on Hierarchical Graphs. In Proc. the international Symposium on Graph Drawing (GD'96), LNCS 1190, Springer-Verlag, 318--333.

Digital Library

[20]

}}Purchase, H. (1997) Which Aesthetic has the Greatest Effect on Human Understanding? In Proc. the 5th international Symposium on Graph Drawing (GD'97), LNCS 1353, 248--261.

Digital Library

[21]

}}Purchase, H., Cohen, R. and James, M. (1996) Validating Graph Drawing Aesthetics. In Proc. the Symposium on Graph Drawing (GD'05), LNCS 1027, Springer-Verlag, 435--446.

Digital Library

[22]

}}Van Ham, F. and Rogowitz, B. (2008) Perceptual Organization in User-Generated Graph Layouts. IEEE Transactions on Visualization and Computer Graphics, 1333--1339.

Digital Library

[23]

}}Ware, C., Purchase, H., Colpoys, L. and McGill, M. (2002) Cognitive Measurements of Graph Aesthetics. Information Visualization, 1(2): 103--110.

Digital Library

Cited By

Murakami AItoh T(2024)Flexible optimization of hierarchical graph layout by genetic algorithm with various conditionsJournal of Visualization10.1007/s12650-024-01018-5Online publication date: 14-Aug-2024
https://doi.org/10.1007/s12650-024-01018-5
Bhowmick SChoi BBhowmick SChoi B(2023)The Building Block of PnP Interfaces: Canned PatternsPlug-and-Play Visual Subgraph Query Interfaces10.1007/978-3-031-16162-9_5(39-47)Online publication date: 14-Mar-2023
https://doi.org/10.1007/978-3-031-16162-9_5
Liu Z(2022)Research and Implementation of Digital Art Media System Based on Big Data Aesthetics3D Imaging—Multidimensional Signal Processing and Deep Learning10.1007/978-981-19-2452-1_20(195-203)Online publication date: 24-Aug-2022
https://doi.org/10.1007/978-981-19-2452-1_20
Show More Cited By

Index Terms

Exploring the relative importance of crossing number and crossing angle
1. Human-centered computing
  1. Human computer interaction (HCI)
    1. HCI design and evaluation methods

Recommendations

Larger crossing angles make graphs easier to read

Objective: Aesthetics are important in algorithm design and graph evaluation. This paper presents two user studies that were conducted to investigate the impact of crossing angles on human graph comprehension. Method and results: These two studies ...
Improvement on the Crossing Number of Crossing-Critical Graphs
Abstract
The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k. ... $\sqrt{}$
Improvement on the Crossing Number of Crossing-Critical Graphs
Graph Drawing and Network Visualization
Abstract
The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k. ... $\sqrt{}$

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

VINCI '10: Proceedings of the 3rd International Symposium on Visual Information Communication

September 2010

149 pages

ISBN:9781450304368

DOI:10.1145/1865841

Conference Chairs:
Guozhong Dai,
Kang Zhang,
Maolin Huang,
Program Chairs:
Hongan Wang,
Xiaoru Yuan,
Linmi Tao,
Wei Chen

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Institute of Software, Chinese Academy of Sciences
ACM SIGCHI CHINA
CCF: China Computer Federation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 September 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

VINCI '10

Sponsor:

CCF

VINCI '10: 2010 International Symposium on Visual Information Communication

September 28 - 29, 2010

Beijing, China

Acceptance Rates

Overall Acceptance Rate 71 of 193 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
157
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)2

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Murakami AItoh T(2024)Flexible optimization of hierarchical graph layout by genetic algorithm with various conditionsJournal of Visualization10.1007/s12650-024-01018-5Online publication date: 14-Aug-2024
https://doi.org/10.1007/s12650-024-01018-5
Bhowmick SChoi BBhowmick SChoi B(2023)The Building Block of PnP Interfaces: Canned PatternsPlug-and-Play Visual Subgraph Query Interfaces10.1007/978-3-031-16162-9_5(39-47)Online publication date: 14-Mar-2023
https://doi.org/10.1007/978-3-031-16162-9_5
Liu Z(2022)Research and Implementation of Digital Art Media System Based on Big Data Aesthetics3D Imaging—Multidimensional Signal Processing and Deep Learning10.1007/978-981-19-2452-1_20(195-203)Online publication date: 24-Aug-2022
https://doi.org/10.1007/978-981-19-2452-1_20
Yuan ZChua HBhowmick SYe ZHan WChoi B(2021)Towards plug-and-play visual graph query interfacesProceedings of the VLDB Endowment10.14778/3476249.347625614:11(1979-1991)Online publication date: 27-Oct-2021
https://dl.acm.org/doi/10.14778/3476249.3476256
Burch MHuang WWakefield MPurchase HWeiskopf DHua J(2021)The State of the Art in Empirical User Evaluation of Graph VisualizationsIEEE Access10.1109/ACCESS.2020.30476169(4173-4198)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2020.3047616
Shang LXue CLin YShao J(2019)Visual Representation Strategy of Flow Line in Flow Maps VisualizationHuman Systems Engineering and Design II10.1007/978-3-030-27928-8_125(820-826)Online publication date: 14-Aug-2019
https://doi.org/10.1007/978-3-030-27928-8_125
Demel ADürrschnabel DMchedlidze TRadermacher MWulf L(2018)A Greedy Heuristic for Crossing-Angle MaximizationGraph Drawing and Network Visualization10.1007/978-3-030-04414-5_20(286-299)Online publication date: 26-Sep-2018
https://dl.acm.org/doi/10.1007/978-3-030-04414-5_20
Klammler MMchedlidze TPak A(2018)Aesthetic Discrimination of Graph LayoutsGraph Drawing and Network Visualization10.1007/978-3-030-04414-5_12(169-184)Online publication date: 26-Sep-2018
https://dl.acm.org/doi/10.1007/978-3-030-04414-5_12
Huang WEades PHong SLin C(2013)Improving multiple aesthetics produces better graph drawingsJournal of Visual Languages and Computing10.1016/j.jvlc.2011.12.00224:4(262-272)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.1016/j.jvlc.2011.12.002
Huang W(2013)Establishing aesthetics based on human graph reading behaviorPersonal and Ubiquitous Computing10.1007/s00779-011-0473-217:1(93-105)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1007/s00779-011-0473-2

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents