On the perspectives opened by right angle crossing drawings

  • Authors:

  • Patrizio Angelini;Luca Cittadini;Giuseppe Di Battista;Walter Didimo;Fabrizio Frati;Michael Kaufmann;Antonios Symvonis

  • Affiliations:

  • Dipartimento di Informatica e Automazione, Roma Tre University, Italy;Dipartimento di Informatica e Automazione, Roma Tre University, Italy;Dipartimento di Informatica e Automazione, Roma Tre University, Italy;Dip. di Ingegneria Elettronica e dell'Informazione, Perugia University, Italy;Dipartimento di Informatica e Automazione, Roma Tre University, Italy;Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Germany;Department of Mathematics, National Technical University of Athens, Greece

  • Venue:
  • GD'09 Proceedings of the 17th international conference on Graph Drawing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Right Angle Crossing (RAC) drawings are polyline drawings where each crossing forms four right angles. RAC drawings have been introduced because cognitive experiments provided evidence that increasing the number of crossings does not decrease the readability of the drawing if the edges cross at right angles. We investigate to what extent RAC drawings can help in overcoming the limitations of widely adopted planar graph drawing conventions, providing both positive and negative results. First, we prove that there exist acyclic planar digraphs not admitting any straight-line upward RAC drawing and that the corresponding decision problem is NP-hard. Also, we show digraphs whose straight-line upward RAC drawings require exponential area. Second, we study if RAC drawings allow us to draw bounded-degree graphs with lower curve complexity than the one required by more constrained drawing conventions. We prove that every graph with vertex-degree at most 6 (at most 3) admits a RAC drawing with curve complexity 2 (resp. 1) and with quadratic area. Third, we consider a natural non-planar generalization of planar embedded graphs. Here we give bounds for curve complexity and area different from the ones known for planar embeddings.