Graphs that Admit Right Angle Crossing Drawings

13 years 3 months ago

Download sma.epfl.ch

We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most 6.5n and 74.2n, respectively. This is a strengthening of a recent result of Didimo et al.

Karin Arikushi, Radoslav Fulek, Balázs Kesz

Real-time Traffic

Didimo Et | Polygonal Arcs | Right Angle | Theoretical Computer Science | WG 2010 |

claim paper

» On the Parameterized Complexity of Layered Graph Drawing

» Characterizing Families of Cuts That Can Be Represented by AxisParallel Rectangles

» Proximity drawings in polynomial area and volume

» Untangling Tanglegrams Comparing Trees by Their Drawings

» Using eye tracking to investigate graph layout effects

» Planar minimally rigid graphs and pseudotriangulations

» Planarity Testing and Optimal Edge Insertion with Embedding Constraints

Post Info
More Details (n/a)

Added	31 Jan 2011
Updated	31 Jan 2011
Type	Journal
Year	2010
Where	WG
Authors	Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth

Comments (0)

Sciweavers

Graphs that Admit Right Angle Crossing Drawings

Didimo Et | Polygonal Arcs | Right Angle | Theoretical Computer Science | WG 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers