Drawing Outer 1-planar Graphs with Few Slopes
نویسندگان
چکیده
منابع مشابه
Drawing Outer 1-planar Graphs with Few Slopes
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees. We show that an outer 1-planar graph G of bounded degree ∆ admits an outer 1-planar straight-line drawing that uses O(∆) different slopes, which gen...
متن کاملDrawing Planar Graphs of Bounded Degree with Few Slopes
We settle a problem of Dujmović, Eppstein, Suderman, and Wood by showing that there exists a function f with the property that every planar graph G with maximum degree d admits a drawing with noncrossing straight-line edges, using at most f(d) different slopes. If we allow the edges to be represented by polygonal paths with one bend, then 2d slopes suffice. Allowing two bends per edge, every pl...
متن کاملDrawing Planar Graphs with Few Geometric Primitives
We define the visual complexity of a plane graph drawing to be the number of basic 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 edges of the same vertex). Let n denote the number of vertices of a graph. We show that trees can be drawn with 3n/4 straight-line segments on a ...
متن کاملDrawings of planar graphs with few slopes and segments
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 52n segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane dr...
متن کاملDrawing Graphs with Few Arcs
Let G = (V,E) be a planar graph. An arrangement of circular arcs is called a composite arc-drawing of G, if its 1-skeleton is isomorphic to G. Similarly, a composite segment-drawing is described by an arrangement of straight-line segments. We ask for the smallest possible ground set of arcs/segments for a composite arc/segment-drawing. We present algorithms for constructing composite arc-drawin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2015
ISSN: 1526-1719
DOI: 10.7155/jgaa.00376