Drawing Graphs with Orthogonal Crossings

Details Drawing Graphs with Orthogonal Crossings Drawing Graphs with Orthogonal Crossings

2010-01-18

arxiv.org/abs/1001.3117v3

Mathematics

Combinatorics

8 pages, 5 figures

Scientific paper

By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We consider the class of graphs that admit a poly-line drawing, in which each edge has at most one bend (resp. two bends) and any two edges can cross only at a right angle. It is shown that the number of edges of such graphs is at most O(n) (resp. O(n \log^2 n)). This is a strengthening of a recent result of Didimo et al.

Affiliated with

Also associated with

No associations

Rating

Drawing Graphs with Orthogonal Crossings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Drawing Graphs with Orthogonal Crossings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Drawing Graphs with Orthogonal Crossings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-661484