Polyline Drawings with Topological Constraints

DOI10.4230/LIPICS.ISAAC.2018.39MaRDI QIDQ5091031zbMATH OpenOpenAlexFDO

Authors Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Fabrizio Montecchiani, Henk Meijer

Publication date 21 July 2022

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2018/9987/pdf/LIPIcs-ISAAC-2018-39.pdf/

zbMATH Keywords

graph drawingtopological graphscurve complexityk-planar graphsskewness-k graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Polyline drawings with topological constraints
• On the size of graphs that admit polyline drawings with few bends and crossing angles
• Graphs that admit polyline drawings with few crossing angles
• On Planar Polyline Drawings
• scientific article; zbMATH DE number 7030516

Cites work

• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• 2-connected spanning subgraphs of planar 3-connected graphs
• Drawing plane graphs nicely
• Guest Editors' Foreword and Overview
• On Optimal 2- and 3-Planar Graphs
• Relating graph thickness to planar layers and bend complexity
• Straight-Line Drawability of a Planar Graph Plus an Edge

Cited in

(4)

• On the skewness of Cartesian products with trees
• How to draw a planarization
• Trade-Offs in Planar Polyline Drawings
• Polyline drawings with topological constraints

This page was built for publication: Polyline Drawings with Topological Constraints

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