DeepAI AI Chat
Log In Sign Up

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics

by   Markus Chimani, et al.
Universität Osnabrück

We present a thorough experimental evaluation of several crossing minimization heuristics that are based on the construction and iterative improvement of a planarization, i.e., a planar representation of a graph with crossings replaced by dummy vertices. The evaluated heuristics include variations and combinations of the well-known planarization method, the recently implemented star reinsertion method, and a new approach proposed herein: the mixed insertion method. Our experiments reveal the importance of several implementation details such as the detection of non-simple crossings (i.e., crossings between adjacent edges or multiple crossings between the same two edges). The most notable finding, however, is that the insertion of stars in a fixed embedding setting is not only significantly faster than the insertion of edges in a variable embedding setting, but also leads to solutions of higher quality.


page 1

page 2

page 3

page 4


On Fan-Crossing Graphs

A fan is a set of edges with a single common endpoint. A graph is fan-cr...

On the 2-colored crossing number

Let D be a straight-line drawing of a graph. The rectilinear 2-colored c...

On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens

A star-simple drawing of a graph is a drawing in which adjacent edges do...

Geometric Crossing-Minimization – A Scalable Randomized Approach

We consider the minimization of edge-crossings in geometric drawings of ...

An effective crossing minimisation heuristic based on star insertion

We present a new heuristic method for minimising crossings in a graph. T...

On Layered Fan-Planar Graph Drawings

In this paper, we study fan-planar drawings that use h layers and are pr...

Rejoinder on: Minimal penalties and the slope heuristics: a survey

This text is the rejoinder following the discussion of a survey paper ab...