Results 31 to 40 of about 2,072,739 (293)
Upward Three-Dimensional Grid Drawings of Graphs [PDF]
, 2005 A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings
A. Garg +27 more
core +3 more sources
Journal of Graph Algorithms and Applications, 2011 Summary: We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between
ANGELINI, PATRIZIO +4 more
+6 more sources
Annular and pants thrackles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices.
Grace Misereh, Yuri Nikolayevsky
doaj +1 more source
Multi-level Graph Drawing using Infomap Clustering [PDF]
International Symposium Graph Drawing and Network Visualization, 2019 Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice for large graphs.
Seok-Hee Hong +7 more
semanticscholar +1 more source
Minimal Graphs with Respect to Geometric Distance Realizability
Discussiones Mathematicae Graph Theory, 2021 A graph G is minimal non-unit-distance graph if there is no drawing of G in Euclidean plane having all edges of unit length, but, for each edge e of G, G − e has such a drawing.
Madaras Tomáš, Široczki Pavol
doaj +1 more source
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity [PDF]
, 2013 We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any \epsilon>0; finding
D. Dolev +18 more
core +3 more sources
Drawing Planar Graphs with a Prescribed Inner Face [PDF]
, 2013 Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of ...
C.A. Duncan +7 more
core +2 more sources
Experimental analysis of the accessibility of drawings with few segments [PDF]
, 2017 The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges ...
Kindermann, Philipp +2 more
core +9 more sources
Modifying Orthogonal Drawings for Label Placement
Algorithms, 2016 In this paper, we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost (i.e., minimum increase of the area and preservation of the quality of the drawing).
Konstantinos G. Kakoulis +1 more
doaj +1 more source
The structure and the list 3-dynamic coloring of outer-1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge.
Yan Li, Xin Zhang
doaj +1 more source