the proceedings contain 44 papers. the special focus in this conference is on graphdrawing and networkvisualization. the topics include: Arrangements of pseudocircles: Triangles and drawings;drawing bobbin lace grap...
ISBN:
(纸本)9783319739144
the proceedings contain 44 papers. the special focus in this conference is on graphdrawing and networkvisualization. the topics include: Arrangements of pseudocircles: Triangles and drawings;drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs;many touchings force many crossings;thrackles: An improved upper bound;on smooth orthogonal and octilinear drawings: Relations, complexity and Kandinsky drawings;EPG-representations with small Grid-Size;mixed linear layouts of planar graphs;upward partitioned book embeddings;experimental evaluation of book drawing algorithms;on the edge-length ratio of outerplanar graphs;visual similarity perception of directed acyclic graphs: A study on influencing factors;giViP: A visual profiler for distributed graph processing systems;drawing big graphs using spectral sparsification;revisited experimental comparison of node-link and matrix representations;improved bounds for drawing trees on fixed points with L-Shaped edges;on upward drawings of trees on a given grid;simple compact monotone tree drawings;visualizing Co-phylogenetic reconciliations;anisotropic radial layout for visualizing centrality and structure in graphs;computing storyline visualizations with few block crossings;on vertex- and empty-ply proximity drawings;MLSEB: Edge bundling using moving least squares approximation;drawing dynamic graphs without timeslices;colored point-set embeddings of acyclic graphs;planar drawings of fixed-mobile bigraphs;ordered level planarity, geodesic planarity and Bi-Monotonicity;non-crossing paths with geographic constraints;planar L-drawings of directed graphs;nodeTrix planarity testing with small clusters;the painter’s problem: Covering a grid with colored connected polygons;triangle-free penny graphs: Degeneracy, Choosability, and edge count;1-fan-bundle-planar drawings of graphs;gap-planar graphs;beyond outerplanarity.
We show that every planar graph has a monotone topological 2-page book embedding where at most (4n - 10)/5 (of potentially 3n - 6) edges cross the spine, and every edge crosses the spine at most once;such an edge is c...
详细信息
We show that several types of graphdrawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximate...
详细信息
We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding and if it does not. Our algorithm returns a planar rectilinear dr...
详细信息
Storyline visualizations depict the temporal dynamics of social interactions, as they describe how groups of actors (individuals or organizations) change over time. A common constraint in storyline visualizations is t...
详细信息
Partial edge drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices. In a PED, by erasing the central parts of edges, ...
详细信息
ISBN:
(纸本)9783030358020;9783030358013
Partial edge drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices. In a PED, by erasing the central parts of edges, all edge crossings and the resulting visual clutter are hidden in the undrawn parts of the edges. In symmetric partial edge drawings (SPEDs), the two stubs of each edge are required to have the same length. It is known that maximizing the ink (or the total stub length) when transforming a straight-line graphdrawing with crossings into a SPED is tractable for 2-plane input drawings, but NP-hard for unrestricted inputs. We show that the problem remains NP-hard even for 3-plane input drawings and establish NP-hardness of ink maximization for PEDs of 4-plane graphs. Yet, for k-plane input drawings whose edge intersection graph forms a collection of trees or, more generally, whose intersection graph has bounded treewidth, we present efficient algorithms for computing maximum-ink PEDs and SPEDs. We implemented the treewidth-based algorithms and show a brief experimental evaluation.
Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. this double structural nature makes it difficult to adopt a homogene...
详细信息
ISBN:
(纸本)9783030358020;9783030358013
Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. this double structural nature makes it difficult to adopt a homogeneous visualization model that clearly conveys an overview of the network and the internal structure of its communities at the same time. As a consequence, the use of hybrid visualizations has been proposed. For instance, NodeTrix combines node-link and matrix-based representations (Henry et al., 2007). In this paper we describe ChordLink, a hybrid visualization model that embeds chord diagrams, used to represent dense subgraphs, into a node-link diagram, which shows the global network structure. the visualization is intuitive and makes it possible to interactively highlight the structure of a community while keeping the rest of the layout stable. We discuss the intriguing algorithmic challenges behind the ChordLink model, present a prototype system, and illustrate case studies on real-world networks.
A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph G, the minimum such number (over all drawings in d...
详细信息
ISBN:
(纸本)9783030358020;9783030358013
A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph G, the minimum such number (over all drawings in dimension d is an element of {2, 3}) is called the d-dimensional weak line cover number and denoted by pi(1)(d)(G). In 3D, the minimum number of planes needed to cover all vertices of G is denoted by pi(2)(3)(G). When edges are also required to be covered, the corresponding numbers rho(1)(d)(G) and rho(2)(3) (G) are called the (strong) line cover number and the (strong) plane cover number. Computing any of these cover numbers-except pi(1)(2)(G)-is known to be NP-hard. the complexity of computing pi(1)(2)(G) was posed as an open problem by Chaplick et al. [WADS 2017]. We show that it is NP-hard to decide, for a given planar graph G, whether pi(1)(2)(G) = 2. We further show that the universal stacked triangulation of depth d, G(d), has pi(1)(2)(G(d)) = d+ 1. Concerning 3D, we show that any n-vertex graph G with rho(2)(3)(G) = 2 has at most 5n - 19 edges, which is tight.
this report describes the 25th Annual graphdrawing Contest, held in conjunction withthe 26thinternationalsymposium on graphdrawing and networkvisualization (gd'18) in Barcelona, Spain. the mission of the Gra...
详细信息
ISBN:
(纸本)9783030044145;9783030044138
this report describes the 25th Annual graphdrawing Contest, held in conjunction withthe 26thinternationalsymposium on graphdrawing and networkvisualization (gd'18) in Barcelona, Spain. the mission of the graphdrawing Contest is to monitor and challenge the current state of the art in graph-drawing technology.
Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties. We investigate the use of spectral sparsification to prod...
详细信息
暂无评论