Force-Directed Lombardi-Style Graph Drawing

Chernobelskiy, Roman; Cunningham, Kathryn I.; Goodrich, Michael T.; Kobourov, Stephen G.; Trott, Lowell

doi:10.1007/978-3-642-25878-7_31

Cited by 32 publications

(27 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, two force-directed methods that produce Lombardi (or near-Lombardi) drawings of graphs were proposed by Chernobelskiy et al [16]. In both cases every edge of the graph is represented by a circular arc and the algorithms aim to maximize the angular resolution at every vertex; implementations of these two algorithms are used in our study.…”

Section: Related Workmentioning

confidence: 99%

“…This is a straight-forward generalization of the straight-line spring embedder, also referred to as the "tangent-based algorithm" [16]. For each vertex v ∈ V , three appropriately scaled forces are added together with a fourth rotational force in order to determine the overall force F (v) acting on the vertex.…”

Section: Lombardi Embedder (Le)mentioning

confidence: 99%

“…This "dummy vertex algorithm" [16], begins with the straight-line drawing obtained from TS. Every edge is subdivided with the addition of a "dummy vertex".…”

Section: Restricted Lombardi Embedder (Rle)mentioning

confidence: 99%

See 2 more Smart Citations

On the Usability of Lombardi Graph Drawings

et al. 2013

Self Cite

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: Lombardi Embedder (Le)mentioning

confidence: 99%

See 1 more Smart Citation

On the Usability of Lombardi Graph Drawings

et al. 2013

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many scholars have worked on algorithms in attempt to reproduce its aesthetics (e.g. Duncan et al 2010;Chernobelskiy et al 2012;Eppstein 2013). This paper is not an algorithmic instruction to computerise the act of drawing, but to conceptualise the elements of drawing and exemplify the meanings of elements within the drawing itself.…”

Section: Visualising Inspiration As a Networkmentioning

confidence: 99%

Conceptualising Inspiration Networks in Game Design

Tomitsch

Bednarz

2015

ToDIGRA

View full text Add to dashboard Cite

This paper examines the concept of inspiration and proposes a design process for inspiration networks using survey data from Global Game Jam. Global Game Jam is a 48-hour game development competition that invites anyone to participate worldwide. The study illuminates the presence of the famous 'six degrees of separation' effect in these inspiration networks, leveraged to model ideations as related concepts, identifying four major lodestars. It follows research through design, embodying the body of knowledge in the inspiration network as a design artifact. Inspiration networks offer a novel way to discover game genres that have not yet been formally recognised, but have displayed a large influence. The findings offer three design implications: an understanding gained by "thinking with networks", the ability to identify emerging game genres, and the support for intuitive, visual browsing of ideas. Formalisation of inspiration network poses an open field for research.

show abstract

“…In the same year, SunQiang succeed in applying force-directed methods to the optimization of peak power consumption, Xinhua studied the distribution network boot line diagram automatic mapping with the use of force-directed methods. In 2012, Cherno-belskiy, R show that approaches produce near-Lombardi drawing, with one being slightly better at achieving near-perfect angular resolution [4] . Kobourov, Stephen G. Embedders put forward to that Force-Directed Graph Drawing Algorithms [5].Bannister, M. J show that force-directed layout algorithms produce graph drawing by resolving a system of emulated physical forces [6].…”

Section: Introductionmentioning

confidence: 99%

Research on Force-directed Algorithm Optimization Methods

Wang¹,

Wang²,

Wang³

et al. 2014

Advances in Intelligent Systems Research

View full text Add to dashboard Cite

-In view of the fundamental Forces-directed iteration the shortcoming of the slow speed, In this paper, using the method of Hyper node and Multilayer method to improve the algorithm and applied to the large-scale graphics drawing automatically, Hyper node Method is the distance of the vertex as a Hyper node to the whole processing, with the Octree data structure to define and iterate over Hyper node. Multilayer method using maximum independent edge set or maximum independent set of points to simplify the graphics on a large scale, by Forces-directed of solving optimization simplified diagram and then find the original inverse iteration. Experiments show that the method of Automatic drawing to draw true and vivid, drawing speed is greatly increased and well expressed the people's automatic drawing intentions with Multilayer method and Hyper nodes.

show abstract

Force-Directed Lombardi-Style Graph Drawing

Cited by 32 publications

References 34 publications

On the Usability of Lombardi Graph Drawings

On the Usability of Lombardi Graph Drawings

Conceptualising Inspiration Networks in Game Design

Research on Force-directed Algorithm Optimization Methods

Contact Info

Product

Resources

About