An experimental study on the ply number of straight-line drawings

DOI10.1007/978-3-319-53925-6_11MaRDI QIDQ2980905zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• An experimental study on the ply number of straight-line drawings
• An Interactive Tool to Explore and Improve the Ply Number of Drawings
• Low Ply Drawings of Trees
• On vertex- and empty-ply proximity drawings
• scientific article; zbMATH DE number 1424309

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• An algorithm for drawing general undirected graphs
• Are crossings important for drawing large graphs?
• Emergence of Scaling in Random Networks
• Empirical evaluation of aesthetics-based graph layout
• Energy Models for Graph Clustering
• Graph Drawing
• Graph Drawing
• Graph drawing software
• Handbook of graph drawing and visualization
• How to draw a planar graph on a grid
• Large-Graph Layout Algorithms at Work: An Experimental Study
• Low Ply Drawings of Trees
• Stress functions for nonlinear dimension reduction, proximity analysis, and graph drawing

Cited in

(3)

• An Interactive Tool to Explore and Improve the Ply Number of Drawings
• An experimental study on the ply number of straight-line drawings
• On vertex- and empty-ply proximity drawings

Describes a project that uses

Uses Software

• Gephi
• OGDF
• NetworkX

This page was built for publication: An experimental study on the ply number of straight-line drawings

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