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

DOI10.7155/jgaa.00484zbMath1405.05124OpenAlexW2911524501MaRDI QIDQ4622771

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

Publication date: 14 February 2019

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00484

zbMATH Keywords

graph drawing algorithmsply number of a drawing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Uses Software

• NetworkX
• OGDF
• Gephi
• Ply

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?
• GraphMaps: Browsing Large Graphs as Interactive Maps
• Low Ply Drawings of Trees
• Emergence of Scaling in Random Networks
• Mining Graph Data
• On Vertex- and Empty-Ply Proximity Drawings
• An Interactive Tool to Explore and Improve the Ply Number of Drawings
• Large-Graph Layout Algorithms at Work: An Experimental Study
• Energy Models for Graph Clustering
• Graph Drawing
• Graph Drawing