Non-aligned Drawings of Planar Graphs
نویسندگان
چکیده
منابع مشابه
Non-aligned Drawings of Planar Graphs
A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible n × n-grid. They also showed that such drawings exist if up to n− 3 edges may have a bend. In this paper, we give algorithms for non-aligned planar drawings that imp...
متن کاملAligned Drawings of Planar Graphs
Let G be a graph embedded in the plane and let A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and A is a planar polyline drawing Γ of G with an arrangement A of lines so that Γ and A are homeomorphic to G and A. We show that if A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and A have...
متن کاملPlanar Open Rectangle-of-Influence Drawings with Non-aligned Frames
A straight-line drawing of a graph is an open weak rectangleof-influence (RI) drawing, if there is no vertex in the relative interior of the axis-parallel rectangle induced by the end points of each edge. No algorithm is known to test whether a graph has a planar open weak RI-drawing, not even for inner triangulated graphs. In this paper, we study RI-drawings that must have a non-aligned frame,...
متن کاملReally Straight Drawings II: Non-Planar Graphs
We study straight-line drawings of non-planar graphs with few slopes. Interval graphs, co-comparability graphs and AT-free graphs are shown to have have drawings in which the number of slopes is bounded by the maximum degree. We prove that graphs of bounded degree and bounded treewidth have drawings with O(log n) slopes. Finally we prove that every graph has a drawing with one bend per edge, in...
متن کاملDrawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding π of the ver-tex set of G into the plane. Let fix (G, π) be the maximum integer k such that there exists a crossing-free redrawing π ′ of G which keeps k vertices k. We give examples of planar graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2017
ISSN: 1526-1719
DOI: 10.7155/jgaa.00444