Radial drawings of graphs: geometric constraints and trade-offs

DOI10.1016/j.jda.2006.12.007zbMath1152.68041OpenAlexW2095322807WikidataQ62042566 ScholiaQ62042566MaRDI QIDQ954965

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.12.007

zbMATH Keywords

graph drawingaesthetic constraintsradial drawingssemantic constraints

Mathematics Subject Classification ID

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)

Related Items

Planar straight-line realizations of 2-trees with prescribed edge lengths

Uses Software

• visone

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Curve-constrained drawings of planar graphs
• How to draw a planar graph on a grid
• On the thickness of graphs of given degree
• Advances in the theory and practice of graph drawing
• Radial Level Planarity Testing and Embedding in Linear Time
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Computing Radial Drawings on the Minimum Number of Circles
• Computing and Combinatorics
• Graph Drawing
• Drawing graphs. Methods and models
• Embedding planar graphs at fixed vertex locations