Results 11 to 20 of about 51,611 (258)
Drawing Graphs on a Smartphone [PDF]
Journal of Graph Algorithms and Applications, 2011 Summary: We present a system for the visualization of information modeled in terms of a graph on a smartphone. First, we show the adopted visualization paradigm, that allows the user to navigate the graph using a focus-based approach. Second, we tackle the algorithmic challenges posed by the new visualization paradigm, introducing and experimenting ...
Giordano Da Lozzo +2 more
openaire +1 more source
-shaped point set embeddings of high-degree plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source
On Strict (Outer-)Confluent Graphs
Journal of Graph Algorithms and Applications, 2021 A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by unique smooth paths through a planar system of junctions and arcs.
Henry Förster +3 more
doaj +1 more source
Lombardi Drawings of Graphs [PDF]
Journal of Graph Algorithms and Applications, 2011 We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex.
Christian A. Duncan +4 more
openaire +2 more sources
Drawing Halin-graphs with small height
Journal of Graph Algorithms and Applications, 2022 In this paper, we study how to draw Halin-graphs, i.e., planar graphs that consist of a tree $T$ and a cycle among the leaves of that tree. Based on tree-drawing algorithms and the pathwidth $pw(T) $, a well-known graph parameter, we find poly-line ...
Therese Biedl, Milap Sheth
doaj +1 more source
Bend-optimal orthogonal drawings of triconnected plane graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A drawing of a plane graph G in which each edge is represented by a sequence of alternating horizontal and vertical line segments is called an orthogonal drawing.
Siddharth Bhatia, Kunal Lad, Rajiv Kumar
doaj +2 more sources
Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Journal of Graph Algorithms and Applications, 2005 Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality.
Paul Holleis +2 more
openaire +1 more source
On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
Journal of Graph Algorithms and Applications, 2009 A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings.
Md. Rezaul Karim, Md. Saidur Rahman
doaj +1 more source
Journal of Graph Algorithms and Applications, 2017 We introduce a new type of graph drawing called "rook-drawing". A rook-drawing of a graph $G$ is obtained by placing the $n$ nodes of $G$ on the intersections of a regular grid, such that each row and column of the grid supports exactly one node.
David Auber +3 more
doaj +1 more source