Hong, Seok-HeeLiotta, GiuseppeMontecchiani, FabrizioNöllenburg, MartinPiselli, TommasoArchambault, DanielNabney, IanPeltonen, Jaakko2024-05-212024-05-212024978-3-03868-256-1https://doi.org/10.2312/mlvis.20241124https://diglib.eg.org/handle/10.2312/mlvis20241124Motivated by the need for decision-making systems that avoid bias and discrimination, the concept of fairness recently gained traction in the broad field of artificial intelligence, stimulating new research also within the information visualization community. In this paper, we introduce a notion of fairness in network visualization, specifically for straight-line drawings of graphs, a foundational paradigm in the field. We empirically investigate the following research questions: (i) What is the price of incorporating fairness constraints in straight-line drawings? (ii) How unfair is a straight-line drawing that does not optimize fairness as a primary objective? To tackle these questions, we implement an algorithm based on gradient-descent that can compute straight-line drawings of graphs by optimizing multi-objective functions. We experimentally show that one can significantly increase the fairness of a drawing by paying a relatively small amount in terms of reduced readability.Attribution 4.0 International LicenseCCS Concepts: Human-centered computing → Visualization; Theory of computation → Design and analysis of algorithmsHuman centered computing → VisualizationTheory of computation → Design and analysis of algorithms10.2312/mlvis.202411245 pages