Results 1 
8 of
8
Planar and PolyArc Lombardi Drawings
"... Abstract. In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing, and not every planar graph has a planar Lombardi drawing. We introduce kLombardi drawings, in which ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing, and not every planar graph has a planar Lombardi drawing. We introduce kLombardi drawings, in which each edge may be drawn with k circular arcs, noting that every graph has a smooth 2Lombardi drawing. We show that every planar graph has a smooth planar 3Lombardi drawing and further investigate topics connecting planarity and Lombardi drawings. 1
L.: Forcedirected Lombardistyle graph drawing
 In: Proc. 19th Int. Symp. on Graph Drawing
, 2011
"... 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 a ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
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 “Lombardistyle” drawings (which we also call nearLombardi drawings), in which all edges are still circular arcs, but some vertices may not have perfect angular resolution. Both of these algorithms take a forcedirected, springembedding 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 nearLombardi drawings, with one being slightly better at achieving nearperfect angular resolution and the other being slightly better at balancing vertex placements. 1
Smooth Orthogonal Layouts
"... Abstract. We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axisaligned line segments, in smooth orthogonal layouts every edge is made of axisaligned segments and circular arcs with common tange ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axisaligned line segments, in smooth orthogonal layouts every edge is made of axisaligned segments and circular arcs with common tangents. Our goal is to create such layouts with low edge complexity, measured by the number of line and circular arc segments. We show that every biconnected 4planar graph has a smooth orthogonal layout with edge complexity 3. If the input graph has a complexity2 traditional orthogonal layout we can transform it into a smooth complexity2 layout. Using the Kandinsky model for removing the degree restriction, we show that any planar graph has a smooth complexity2 layout. 1
Triangulations with Circular Arcs ⋆
"... Abstract. An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straightline case, it is known that the Delaunay triangulation is optimal in this respect. We propose andstudythe concept of a circular arc triangulation— a simple and e ..."
Abstract
 Add to MetaCart
Abstract. An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straightline case, it is known that the Delaunay triangulation is optimal in this respect. We propose andstudythe concept of a circular arc triangulation— a simple and effective alternative that offers flexibility for additionally enlarging small angles—and discuss its applications in graph drawing. 1
Lombardi Spring Embedder (Short Demo)
"... 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, as measured by the angle formed by the tangents to the edges at the vertex. We descr ..."
Abstract
 Add to MetaCart
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, as measured by the angle formed by the tangents to the edges at the vertex. We describe an algorithm that creates Lombardi or nearLombardi graph drawings, in which all edges are still circular arcs, but some vertices may not have perfect angular resolution. Our algorithm has a fully functional implementation; source code, images and movies illustrating the system can be found at
On The Usability of Lombardi Graph Drawings
"... Abstract. A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circulararc edges and perfect angular resolution at vertices. Little has been known about the effects of curved edges versus straight edges in typical graph reading tasks. In this paper we present the fi ..."
Abstract
 Add to MetaCart
Abstract. A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circulararc edges and perfect angular resolution at vertices. Little has been 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 nearLombardi forcebased 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. 1
Communicated by:
, 2012
"... Optical graph recognition (OGR) reverses graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displays them by icons, and it maps edges to Jordan curves connecting the endpoints. OGR transforms the digital ..."
Abstract
 Add to MetaCart
Optical graph recognition (OGR) reverses graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displays them by icons, and it maps edges to Jordan curves connecting the endpoints. OGR transforms the digital image of a drawn graph into its topological structure. It consists of four phases, preprocessing, segmentation, topology recognition, and postprocessing. OGR is based on established digital image processing techniques. Its novelty is the topology recognition where the edges are recognized with emphasis on the attachment to their vertices and on edge crossings. Our prototypical implementation OGR up shows the effectiveness of the approach and produces a GraphML file, which can be used for further algorithmic studies and graph drawing tools. It has been tested both on handmade graph drawings and on drawings generated by graph drawing algorithms. Submitted:
Prominence • Cohesion • TwoMode Networks • Dynamics
"... Social networks provide a rich source of graph drawing problems, because they appear in an incredibly wide variety of forms and contexts. After sketching the scope of social network analysis, we establish some general principles for social network visualization before finally reviewing applications ..."
Abstract
 Add to MetaCart
Social networks provide a rich source of graph drawing problems, because they appear in an incredibly wide variety of forms and contexts. After sketching the scope of social network analysis, we establish some general principles for social network visualization before finally reviewing applications of, and challenges for, graph drawing methods in this area. Other accounts more generally relating to the status of visualization in social network analysis are given, e.g., in [Klo81, BKR + 99, Fre00, Fre05, BKR06]. Surveys that are more comprehensive on information visualization approaches, interaction, and network applications from social media are given in [CM11, RF10, CY10]. 26.1 Social Network Analysis The fundamental assumption underlying social network theory is the idea that seemingly autonomous individuals and organizations are in fact embedded in social relations and interactions [BMBL09]. The term social network was coined to delineate the relational perspective from other research traditions on social groups and social categories [Bar54]. In general, a social network consists of actors (e.g., persons, organizations) and some form of (often, but not necessarily: social) relation among them. The network structure