
A Greedy Heuristic for Crossing Angle Maximization
The crossing angle of a straightline drawing Γ of a graph G=(V, E) is t...
read it

Graphs with large total angular resolution
The total angular resolution of a straightline drawing is the minimum a...
read it

Singlecrossing Implementation
An election over a finite set of candidates is called singlecrossing if...
read it

An effective crossing minimisation heuristic based on star insertion
We present a new heuristic method for minimising crossings in a graph. T...
read it

Crossing Reduction of Sankey Diagram with Barycentre Ordering via Markov Chain
Sankey diagram is popular for analyzing primary flows in network data. H...
read it

Towards Better Approximation of Graph Crossing Number
Graph Crossing Number is a fundamental problem with various applications...
read it

Polyline Drawings with Topological Constraints
Let G be a simple topological graph and let Γ be a polyline drawing of G...
read it
A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
The crossing resolution of a nonplanar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and interpret a drawing of a graph. However, maximizing the crossing resolution turns out to be an NPhard problem in general and only heuristic algorithms are known that are mainly based on appropriately adjusting forcedirected algorithms. In this paper, we propose a new heuristic algorithm for the crossing resolution maximization problem and we experimentally compare it against the known approaches from the literature. Our experimental evaluation indicates that the new heuristic produces drawings with better crossing resolution, but this comes at the cost of slightly higher aspect ratio, especially when the input graph is large.
READ FULL TEXT
Comments
There are no comments yet.