Strict Confluent Drawing

DOI10.20382/JOCG.V7I1A2MaRDI QIDQ2970442zbMATH OpenOpenAlexFDO

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

Publication date 30 March 2017

Full work available at URL https://arxiv.org/abs/1308.6824

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

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

Recommendations

• Strict confluent drawing
• Graph Drawing
• Strictly convex drawings of planar graphs
• Strictly convex drawings of planar graphs
• Confluent drawing algorithms using rectangular dualization
• Graph Drawing
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• Strictly-convex drawings of 3-connected planar graphs
• Confluent layered drawings
• Graph Drawing

Cited in

(9)

• Graph Drawing
• On strict (outer-)confluent graphs
• On strict (outer-)confluent graphs
• Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
• The widths of strict outerconfluent graphs
• Strict confluent drawing
• Approximating the Bundled Crossing Number
• Crossing Layout in Non-planar Graph Drawings
• Graph Drawing

This page was built for publication: Strict Confluent Drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970442)