An Experimental Study on the Ply Number of Straight-Line Drawings

DOI10.1007/978-3-319-53925-6_11zbMath1485.68178OpenAlexW2588550705MaRDI QIDQ2980905

Stephen G. Kobourov, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Walter Didimo

Publication date: 5 May 2017

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

On Vertex- and Empty-Ply Proximity Drawings

Uses Software

• NetworkX
• OGDF
• Gephi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Graph drawing software
• An algorithm for drawing general undirected graphs
• Empirical evaluation of aesthetics-based graph layout
• Are Crossings Important for Drawing Large Graphs?
• Low Ply Drawings of Trees
• Emergence of Scaling in Random Networks
• Large-Graph Layout Algorithms at Work: An Experimental Study
• Energy Models for Graph Clustering
• Graph Drawing
• Graph Drawing