Journal of Computational Geometry (Jan 2016)

Strict confluent drawing

  • David Eppstein,
  • Danny Holten,
  • Maarten Löffler,
  • Martin Nöllenburg,
  • Bettina Speckmann,
  • Kevin Verbeek

DOI
https://doi.org/10.20382/jocg.v7i1a2
Journal volume & issue
Vol. 7, no. 1

Abstract

Read online

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).