Author Keywords: Graph drawing; Voronoi diagrams; Graph characterization; Geometric graphs 相似文献
共查询到20条相似文献,搜索用时 15 毫秒
1.
Ashim Garg 《Discrete Applied Mathematics》2007,155(9):1116-1140
It is important to minimize the area of a drawing of a graph, so that the drawing can fit in a small drawing-space. It is well-known that a planar graph with n vertices admits a planar straight-line grid drawing with O(n2) area [H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10(1) (1990) 41-51; W. Schnyder, Embedding planar graphs on the grid, in: Proceedings of the First ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 138-148]. Unfortunately, there is a matching lower-bound of Ω(n2) on the area-requirements of the planar straight-line grid drawings of certain planar graphs. Hence, it is important to investigate important categories of planar graphs to determine if they admit planar straight-line grid drawings with o(n2) area.In this paper, we investigate an important category of planar graphs, namely, outerplanar graphs. We show that an outerplanar graph G with degree d admits a planar straight-line grid drawing with area O(dn1.48) in O(n) time. This implies that if d=o(n0.52), then G can be drawn in this manner in o(n2) area. 相似文献
2.
In this paper, we present a framework and two linear time algorithms for obtaining circular drawings of graphs. The first technique produces circular drawings of biconnected graphs and finds a zero crossing circular drawing if one exists. The second technique finds multiple embedding circle drawings. Techniques for the reduction of edge crossings are also discussed. Results of experimental studies are included. 相似文献
3.
This paper addresses the problem of finding rectangular drawings of plane graphs, in which each vertex is drawn as a point, each edge is drawn as a horizontal or a vertical line segment, and the contour of each face is drawn as a rectangle. A graph is a 2–3 plane graph if it is a plane graph and each vertex has degree 3 except the vertices on the outer face which have degree 2 or 3. A necessary and sufficient condition for the existence of a rectangular drawing has been known only for the case where exactly four vertices of degree 2 on the outer face are designated as corners in a 2–3 plane graph G. In this paper we establish a necessary and sufficient condition for the existence of a rectangular drawing of G for the general case in which no vertices are designated as corners. We also give a linear-time algorithm to find a rectangular drawing of G if it exists. 相似文献
4.
Marc van Kreveld 《Computational Geometry》2011,44(9):499-506
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges and zero-size vertices exist only in theory. Let r denote the radius of the disks that show vertices and w the width of edges. We give a list of conditions that make such a drawing good and that apply to not necessarily planar graphs. We show that if r<w, a vertex must have constant degree for a drawing to satisfy the conditions, and if r?w, a vertex can have any degree. We also give an algorithm that, for a given drawing and values for r and w, determines whether the bold drawing satisfies the conditions. Furthermore, we show how to maximize r and/or w without violating the conditions in polynomial time. 相似文献
5.
We study the problem of characterizing sets of points whose Voronoi diagrams are trees and if so, what are the combinatorial properties of these trees. The second part of the problem can be naturally turned into the following graph drawing question: Given a tree T, can one represent T so that the resulting drawing is a Voronoi diagram of some set of points? We investigate the problem both in the Euclidean and in the Manhattan metric. The major contributions of this paper are as follows.
• We characterize those trees that can be drawn as Voronoi diagrams in the Euclidean metric.
• We characterize those sets of points whose Voronoi diagrams are trees in the Manhattan metric.
• We show that the maximum vertex degree of any tree that can be drawn as a Manhattan Voronoi diagram is at most five and prove that this bound is tight.
• We characterize those binary trees that can be drawn as Manhattan Voronoi diagrams.
6.
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ5 and all large n, there is a Δ-regular n-vertex graph with slope-number at least . This is the best known lower bound on the slope-number of a graph with bounded degree. We prove upper and lower bounds on the slope-number of complete bipartite graphs. We prove a general upper bound on the slope-number of an arbitrary graph in terms of its bandwidth. It follows that the slope-number of interval graphs, cocomparability graphs, and AT-free graphs is at most a function of the maximum degree. We prove that graphs of bounded degree and bounded treewidth have slope-number at most . Finally we prove that every graph has a drawing with one bend per edge, in which the number of slopes is at most one more than the maximum degree. In a companion paper, planar drawings of graphs with few slopes are also considered. 相似文献
7.
Carla Binucci Emilio Di Giacomo Walter Didimo Alejandro Estrella-Balderrama Fabrizio Frati Stephen G. Kobourov Giuseppe Liotta 《Computational Geometry》2010,43(2):219-232
In this paper we study the problem of computing an upward straight-line embedding of a planar DAG (directed acyclic graph) G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. In particular, we show that no biconnected DAG admits an upward straight-line embedding into every point set in convex position. We provide a characterization of the family of DAGs that admit an upward straight-line embedding into every convex point set such that the points with the largest and the smallest y-coordinate are consecutive in the convex hull of the point set. We characterize the family of DAGs that contain a Hamiltonian directed path and that admit an upward straight-line embedding into every point set in general position. We also prove that a DAG whose underlying graph is a tree does not always have an upward straight-line embedding into a point set in convex position and we describe how to construct such an embedding for a DAG whose underlying graph is a path. Finally, we give results about the embeddability of some sub-classes of DAGs whose underlying graphs are trees on point set in convex and in general position. 相似文献
8.
Éric Fusy 《Discrete Mathematics》2009,309(7):1870-1894
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under the name of regular edge-labelling and consists of two bipolar orientations that are transversal. For this reason, the terminology used here is that of transversal structures. The main results obtained in the article are a bijection between irreducible triangulations and ternary trees, and a straight-line drawing algorithm for irreducible triangulations. For a random irreducible triangulation with n vertices, the grid size of the drawing is asymptotically with high probability 11n/27×11n/27 up to an additive error of . In contrast, the best previously known algorithm for these triangulations only guarantees a grid size (⌈n/2⌉−1)×⌊n/2⌋. 相似文献
9.
We study the problem of computing hierarchical drawings of layered graphs when some pairs of edges are not allowed to cross. We show that deciding the existence of a drawing satisfying at least k non-crossing constraints from a given set is NP-hard, even if the graph is 2-layered and even when the permutation of the vertices on one side of the bipartition is fixed. We then propose simple constant-ratio approximation algorithms for the optimization version of the problem, which requires to find a maximum realizable subset of constraints, and we discuss how to extend the well-known hierarchical approach for creating layered drawings of directed graphs so as to minimize the number of edge crossings while maximizing the number of satisfied constraints. 相似文献
10.
A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing. 相似文献
11.
In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic criteria in graph drawing. More specifically, we present two algorithms: a symmetry finding algorithm which finds maximum number of three dimensional symmetries, and a drawing algorithm which constructs linkless symmetric drawings of series parallel digraphs in three dimensions. 相似文献
12.
13.
We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies. 相似文献
14.
This paper studies how to compute radially layered drawings of graphs by taking into account additional geometric constraints which correspond to typical aesthetic and semantic requirements for the visualization. The following requirements are considered: vertex centrality, edge crossings, curve complexity, and radial distribution of the vertices. Trade-offs among these requirements are discussed and different linear-time drawing algorithms are presented. 相似文献
15.
We discuss several forms of thep-center location problems on an undirected tree network. Our approach is based on utilizing results for rigid circuit graphs to obtain polynomial algorithms for solving the model. Duality theory on perfect graphs is used to define and solve the dual location model. 相似文献
16.
Richard T. Wong 《Mathematical Programming》1984,28(3):271-287
The Steiner tree problem on a directed graph (STDG) is to find a directed subtree that connects a root node to every node
in a designated node setV. We give a dual ascent procedure for obtaining lower bounds to the optimal solution value. The ascent information is also
used in a heuristic procedure for obtaining feasible solutions to the STDG. Computational results indicate that the two procedures
are very effective in solving a class of STDG's containing up to 60 nodes and 240 directed/120 undirected arcs.
The directed spanning tree and uncapacitated plant location problems are special cases of the STDG. Using these relationships,
we show that our ascent procedure can be viewed as a generalization ofboth the Chu-Liu-Edmonds directed spanning tree algorithm and the Bilde-Krarup-Erlenkotter ascent algorithm for the plant location
problem. The former comparison yields a dual ascent interpretation of the steps of the directed spanning tree algorithm. 相似文献
17.
18.
Stephen W. Hruska 《Discrete Mathematics》2008,308(10):1801-1809
This paper investigates the problem of embedding a graph into a tree with the same vertex set (a spanning tree in particular), such that the maximum congestion of the edges is minimized. We calculate exact formulas for the tree congestion and spanning tree congestion for various families of graphs, including grids and complete bipartite graphs. 相似文献
19.
Giuseppe Di Battista Giuseppe Liotta Sue H. Whitesides 《Journal of Discrete Algorithms》2006,4(3):384
This paper studies weak proximity drawings of graphs and demonstrates their advantages over strong proximity drawings in certain cases. Weak proximity drawings are straight line drawings such that if the proximity region of two points p and q representing vertices is devoid of other points representing vertices, then segment (p,q) is allowed, but not forced, to appear in the drawing. This differs from the usual, strong, notion of proximity drawing in which such segments must appear in the drawing.Most previously studied proximity regions are associated with a parameter β, 0β∞. For fixed β, weak β-drawability is at least as expressive as strong β-drawability, as a strong β-drawing is also a weak one. We give examples of graph families and β values where the two notions coincide, and a situation in which it is NP-hard to determine weak β-drawability. On the other hand, we give situations where weak proximity significantly increases the expressive power of β-drawability: we show that every graph has, for all sufficiently small β, a weak β-proximity drawing that is computable in linear time, and we show that every tree has, for every β less than 2, a weak β-drawing that is computable in linear time. 相似文献
20.
C. M. Da Fonseca 《Annali di Matematica Pura ed Applicata》2008,187(2):251-261
A different approach is given to recent results due mainly to R. C. Johnson and A. Leal Duarte on the multiplicities of eigenvalues
of a Hermitian matrix whose graph is a tree. The techniques developed are based on some results of matching polynomials and
used a work by O. L. Heilmann and E. H. Lieb on an apparently unrelated topic.
相似文献