Graph drawing by force-directed placement
Software—Practice & Experience
On the Angular Resolution of Planar Graphs
SIAM Journal on Discrete Mathematics
Angles of Planar Triangular Graphs
SIAM Journal on Discrete Mathematics
A framework for drawing planar graphs with curves and polylines
Journal of Algorithms
Drawing graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
Validating Graph Drawing Aesthetics
GD '95 Proceedings of the Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Planar Polyline Drawings with Good Angular Resolution
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Algorithmica
Angle and distance constraints on tree drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Biclique edge cover graphs and confluent drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Drawing trees with perfect angular resolution and polynomial area
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'10 Proceedings of the 18th international conference on Graph drawing
Curvilinear graph drawing using the force-directed method
GD'04 Proceedings of the 12th international conference on Graph Drawing
Planar and poly-arc lombardi drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Force-directed edge bundling for graph visualization
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
Planar and poly-arc lombardi drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Planar lombardi drawings for subcubic graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Circle-Representations of simple 4-regular planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Force-Directed graph drawing using social gravity and scaling
GD'12 Proceedings of the 20th international conference on Graph Drawing
On the usability of lombardi graph drawings
GD'12 Proceedings of the 20th international conference on Graph Drawing
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |
A Lombardi drawing of a graph is one in which vertices are represented as points, edges are represented as circular arcs between their endpoints, and every vertex has perfect angular resolution (equal angles between consecutive edges, as measured by the tangents to the circular arcs at the vertex). We describe two algorithms that create "Lombardi-style" drawings (which we also call near-Lombardi drawings), in which all edges are still circular arcs, but some vertices may not have perfect angular resolution. Both of these algorithms take a force-directed, spring-embedding approach, with one using forces at edge tangents to produce curved edges and the other using dummy vertices on edges for this purpose. As we show, these approaches produce near-Lombardi drawings, with one being slightly better at achieving near-perfect angular resolution and the other being slightly better at balancing edge placements.