Representations of planar graphs
SIAM Journal on Discrete Mathematics
The maximum number of triangles in arrangements of pseudolines
Journal of Combinatorial Theory Series B
Empirical Evaluation of Aesthetics-based Graph Layout
Empirical Software Engineering
Graph Drawing Software
Cognitive measurements of graph aesthetics
Information Visualization
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs
Discrete & Computational Geometry
Note: On the maximum number of edges in quasi-planar graphs
Journal of Combinatorial Theory Series A
Notes on large angle crossing graphs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Exploring the relative importance of crossing number and crossing angle
Proceedings of the 3rd International Symposium on Visual Information Communication
Graphs that admit right angle crossing drawings
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
The straight-line RAC drawing problem is NP-hard
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the size of graphs that admit polyline drawings with few bends and crossing angles
GD'10 Proceedings of the 18th international conference on Graph drawing
Maximizing the total resolution of graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Optimal 3D angular resolution for low-degree graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Complexity of finding non-planar rectilinear drawings of graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
The quality ratio of RAC drawings and planar drawings of planar graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Bounds on the crossing resolution of complete geometric graphs
Discrete Applied Mathematics
Area, curve complexity, and crossing resolution of non-planar graph drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
On the perspectives opened by right angle crossing drawings
GD'09 Proceedings of the 17th international conference on Graph Drawing
On rectilinear drawing of graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
2-Layer right angle crossing drawings
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Right angle crossing graphs and 1-planarity
GD'11 Proceedings of the 19th international conference on Graph Drawing
Drawing cubic graphs with the four basic slopes
GD'11 Proceedings of the 19th international conference on Graph Drawing
Combining problems on RAC drawings and simultaneous graph drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Drawing graphs with vertices at specified positions and crossings at large angles
GD'11 Proceedings of the 19th international conference on Graph Drawing
Drawing graphs with vertices at specified positions and crossings at large angles
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Establishing aesthetics based on human graph reading behavior: two eye tracking studies
Personal and Ubiquitous Computing
Density of straight-line 1-planar graph drawings
Information Processing Letters
Hi-index | 0.00 |
Cognitive experiments show that humans can read graph drawings in which all edge crossings are at right angles equally well as they can read planar drawings; they also show that the readability of a drawing is heavily affected by the number of bends along the edges. A graph visualization whose edges can only cross perpendicularly is called a RAC (Right Angle Crossing) drawing . This paper initiates the study of combinatorial and algorithmic questions related with the problem of computing RAC drawings with few bends per edge. Namely, we study the interplay between number of bends per edge and total number of edges in RAC drawings. We establish upper and lower bounds on these quantities by considering two classical graph drawing scenarios: The one where the algorithm can choose the combinatorial embedding of the input graph and the one where this embedding is fixed.