Maximizing the Total Resolution of Graphs

Details Maximizing the Total Resolution of Graphs Maximizing the Total Resolution of Graphs

2010-09-10

arxiv.org/abs/1009.2109v2

Computer Science

Data Structures and Algorithms

Scientific paper

A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident to a common node (angular resolution) or by the angles formed at edge crossings (crossing resolution). In this paper, we evaluate both by introducing the notion of "total resolution", that is, the minimum of the angular and crossing resolution. To the best of our knowledge, this is the first time where the problem of maximizing the total resolution of a drawing is studied. The main contribution of the paper consists of drawings of asymptotically optimal total resolution for complete graphs (circular drawings) and for complete bipartite graphs (2-layered drawings). In addition, we present and experimentally evaluate a force-directed based algorithm that constructs drawings of large total resolution.

Affiliated with

Also associated with

No associations

Rating

Maximizing the Total Resolution of Graphs 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 Maximizing the Total Resolution of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximizing the Total Resolution of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-562345