Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators

by   Luca Castelli Aleardi, et al.

In this work we consider balanced Schnyder woods for planar graphs, which are Schnyder woods where the number of incoming edges of each color at each vertex is balanced as much as possible. We provide a simple linear-time heuristic leading to obtain well balanced Schnyder woods in practice. As test applications we consider two important algorithmic problems: the computation of Schnyder drawings and of small cycle separators. While not being able to provide theoretical guarantees, our experimental results (on a wide collection of planar graphs) suggest that the use of balanced Schnyder woods leads to an improvement of the quality of the layout of Schnyder drawings, and provides an efficient tool for computing short and balanced cycle separators.


page 1

page 2

page 3

page 4


Beyond Outerplanarity

We study straight-line drawings of graphs where the vertices are placed ...

Identifying Cluttering Edges in Near-Planar Graphs

Planar drawings of graphs tend to be favored over non-planar drawings. T...

Simplifying Non-Simple Fan-Planar Drawings

A drawing of a graph is fan-planar if the edges intersecting a common ed...

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings

A plus-contact representation of a planar graph G is called c-balanced i...

Nonlinear Eigenproblems in Data Analysis - Balanced Graph Cuts and the RatioDCA-Prox

It has been recently shown that a large class of balanced graph cuts all...

A numerical analysis of planar central and balanced configurations in the (n+1)-body problem with a small mass

Two numerical algorithms for analyzing planar central and balanced confi...

Please sign up or login with your details

Forgot password? Click here to reset