Results 1 to 10 of about 4,519,520 (279)
Area-efficient algorithms for straight-line tree drawings [PDF]
Computational Geometry: Theory and Applications, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chan-Su Shin +2 more
exaly +5 more sources
Area-efficient planar straight-line drawings of outerplanar graphs [PDF]
Discrete Applied Mathematics, 2007 An outerplanar graph \(G\) with \(n\) vertices and maximal degree \(d\) admits a planar straight-line grid drawing with area \(\mathbf O(dn^{1.48})\) in \(\mathbf O(n)\) time. In case \(d=\mathbf o(n^{0.52})\), \(G\) can be drawn this way in \(\mathbf o(n^2)\) area.
Ashim Garg
exaly +5 more sources
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms.
Giuseppe Di Battista, Fabrizio Frati
doaj +6 more sources
The Straight-Line RAC Drawing Problem is NP-Hard [PDF]
Journal of Graph Algorithms and Applications, 2012 A RAC drawing of a graph is a polyline drawing in which every pair of crossing edges intersects at right angle. In this paper, we focus on straight-line RAC drawings and demonstrate an infinite class of graphs with unique RAC combinatorial embedding.
Evmorfia Argyriou +2 more
doaj +4 more sources
Minimizing the Area for Planar Straight-Line Grid Drawings [PDF]
, 2008 Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid drawings. In this paper, we show that it is NP-complete to decide if a planar graph has a planar straight-line drawing on a grid of given size.
Krug, M., Wagner, D.
openaire +3 more sources
Straight-Line Orthogonal Drawings of Binary and Ternary Trees [PDF]
, 2008 In this paper we provide upper and lower bounds on the area requirement of straight-line orthogonal drawings of n-node binary and ternary trees. Namely, we show algorithms for constructing orderpreserving straight-line orthogonal drawings of binary trees in O(n1.5) area, straight-line orthogonal drawings of ternary trees in O(n1.631) area, and straight-
Frati, Fabrizio
openaire +4 more sources
An Experimental Study on the Ply Number of Straight-line Drawings
Journal of Graph Algorithms and Applications, 2019 The ply number of a drawing is a new criterion of interest for graph drawing. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a ...
Felice De Luca +4 more
doaj +6 more sources
GA for straight-line grid drawings of maximal planar graphs [PDF]
Egyptian Informatics Journal, 2012 A straight-line grid drawing of a planar graph G of n vertices 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.
Mohamed A. El-Sayed
doaj +2 more sources
Straight-line drawings of 1-planar graphs
Computational Geometry: Theory and ApplicationsA graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line drawing with a two-coloring of the edges, so that edges of the same color do not cross.
Franz Brandenburg
exaly +3 more sources
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs [PDF]
, 2008 Despite a long research effort, finding the minimum area for straight-line grid drawings of planar graphs is still an elusive goal. A long-standing lower bound on the area requirement for straight-line drawings of plane graphs was established in 1984 by Dolev, Leighton, and Trickey, who exhibited a family of graphs, known as nested triangles graphs ...
Fabrizio Frati, Maurizio Patrignani
openaire +6 more sources