Strict Confluent Drawing

Eppstein, David and Holten, Danny and Löffler, Maarten and Nöllenburg, Martin and Speckmann, Bettina and Verbeek, Kevin (2013) Strict Confluent Drawing. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 352-363(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_31).

Full text not available from this repository.

Abstract

We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be unique. We prove that it is NP-complete to determine whether a given graph has a strict confluent drawing but polynomial to determine whether it has an outerplanar strict confluent drawing with a fixed vertex ordering (a drawing within a disk, with the vertices placed in a given order on the boundary).

Item Type: Conference Paper
Classifications: P Styles > P.300 Curved
P Styles > P.540 Planar
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 13 Aug 2014 15:46
Last Modified: 13 Aug 2014 15:47
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1388

Actions (login required)

View Item View Item