Progress on Partial Edge Drawings

Bruckdorfer, Till and Cornelsen, Sabine and Gutwenger, Carsten and Kaufmann , Michael and Montecchiani, Fabrizio and Nöllenburg, Martin and Wolff, Alexander (2013) Progress on Partial Edge Drawings. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 67-78(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Full text not available from this repository.

Abstract

Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been investigated. The idea of partial edge drawings (PED) is to drop the middle part of edges and rely on the remaining edge parts called stubs. We focus on a symmetric model (SPED) that requires the two stubs of an edge to be of equal length. In this way, the stub at the other endpoint of an edge assures the viewer of the edge's existence. We also consider an additional homogeneity constraint that forces the stub lengths to be a given fraction δ of the edge lengths (δ-SHPED). Given length and direction of a stub, this model helps to infer the position of the opposite stub. We show that, for a fixed stub---edge length ratio δ, not all graphs have a δ-SHPED. Specifically, we show that $K_241$ does not have a 1/4-SHPED, while bandwidth-k graphs always have a $\Theta(1/\sqrt{k})$-SHPED. We also give bounds for complete bipartite graphs. Further, we consider the problem MaxSPED where the task is to compute the SPED of maximum total stub length that a given straight-line drawing contains. We present an efficient solution for 2-planar drawings and a 2-approximation algorithm for the dual problem.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-36763-2_7
Classifications: P Styles > P.720 Straight-line
P Styles > P.999 Others
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 21 Nov 2013 16:46
Last Modified: 21 Nov 2013 16:46
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1298

Actions (login required)

View Item View Item