Strict confluent drawing

D. Eppstein, D. Holten, M. Löffler, M. Nöllenburg, B. Speckmann, K.A.B. Verbeek

Research output: Contribution to journalArticleAcademicpeer-review

55 Downloads (Pure)

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).
Original languageEnglish
Pages (from-to)22-46
JournalJournal of Computational Geometry
Volume7
Issue number1
DOIs
Publication statusPublished - 2016

Fingerprint

Dive into the research topics of 'Strict confluent drawing'. Together they form a unique fingerprint.

Cite this