Planar Polyline Drawings with Good Angular Resolution

Gutwenger, Carsten; Mutzel, Petra

doi:10.1007/3-540-37623-2_13

Cited by 53 publications

(46 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Early work on angular resolution in graph drawing addresses the problem in the straightline setting [5,6] or polyline setting [7]. Even with circular-arc edges, maintaining bounded angular resolution leads to exponential area [8].…”

Section: Related Workmentioning

confidence: 99%

“…Force-directed algorithms have been used to maximize the angular resolution using quadratic and cubic Bézier curves [9] and for fixed position drawings with cubic Bézier curves [10]. Curved edges and polyline edges have been studied in the context of drawing planar graphs with good angular resolution [7]. Rotating optimal angular resolution templates for each vertex in the fixed position setting has also been studied [12].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On the Usability of Lombardi Graph Drawings

et al. 2013

View full text Add to dashboard Cite

Abstract.A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circular-arc edges and perfect angular resolution at vertices. Little is known about the effects of curved edges versus straight edges in typical graph reading tasks. In this paper we present the first user evaluation that empirically measures the readability of three different layout algorithms (traditional spring embedder and two recent near-Lombardi force-based algorithms) for three different tasks (shortest path, common neighbor, vertex degree). The results indicate that, while users prefer the Lombardi drawings, the performance data do not present such a positive picture.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

On the Usability of Lombardi Graph Drawings

et al. 2013

View full text Add to dashboard Cite

show abstract

“…The routing of a curvilinear edge that is being added to an existing drawing is investigated in [9]. In [17,18], algorithms for drawing planar graphs using cubic Bézier curves for the edges are given. In [7], an algorithm is presented for drawing planar graphs with asymptotically optimal area and angular resolution such that the edges are sequences of two circular arcs.…”

Section: Introductionmentioning

confidence: 99%

Curvilinear Graph Drawing Using the Force-Directed Method

Finkel

Tamassia

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a method for modifying a force-directed graph drawing algorithm into an algorithm for drawing graphs with curved lines. Our method is based on embedding control points as dummy vertices so that edges can be drawn as splines. Our experiments show that our method yields aesthetically pleasing curvilinear drawing with improved angular resolution. Applying our method to the GEM algorithm on the test suite of the "Rome Graphs" resulted in an average improvement of 46% in angular resolution and of almost 6% in edge crossings.

show abstract

“…Polyline edges have also been studied in the context of drawing planar graphs with good angular resolution [21,22,25]. In addition, rotating optimal angular resolution templates for each vertex in the fixed position setting has been studied as well [4].…”

Section: Related Workmentioning

confidence: 99%

Force-Directed Lombardi-Style Graph Drawing

et al. 2012

View full text Add to dashboard Cite

Abstract. A Lombardi drawing of a graph is defined as one in which vertices are represented as points, edges are represented as circular arcs between their endpoints, and every vertex has perfect angular resolution (angles between consecutive edges, as measured by the tangents to the circular arcs at the vertex, all have the same degree). 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 both produce near-Lombardi drawings, with one being slightly better at achieving near-perfect angular resolution and the other being slightly better at balancing vertex placements.

show abstract

Planar Polyline Drawings with Good Angular Resolution

Cited by 53 publications

References 19 publications

On the Usability of Lombardi Graph Drawings

On the Usability of Lombardi Graph Drawings

Curvilinear Graph Drawing Using the Force-Directed Method

Force-Directed Lombardi-Style Graph Drawing

Contact Info

Product

Resources

About