Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
نویسندگان
چکیده
منابع مشابه
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
A straight-line grid drawing of a planar graph G 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. Any outerplanar graph of n vertices with maximum degree d has a straight-line grid drawing with area O(dn log n). In this paper, we introduce a subclass of outerplanar graphs, which we call ...
متن کاملStraight-line Drawings of Outerplanar Graphs in O(dn log n) Area
We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjecture [1] on the area requirement of outerplanar graphs by showing that snowflake graphs admit linear area drawings.
متن کاملOn a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area
A straight-line grid drawing of a planar graph G 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. It is well known that a planar graph of n vertices admits a straight-line grid drawing on a grid of area O(n). A lower bound of Ω(n) on the area-requirement for straight-line grid drawings o...
متن کاملStraight-Line Grid Drawings of 3-Connected 1-Planar Graphs
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In general, 1-planar graphs do not admit straightline drawings. We show that every 3-connected 1-planar graph has a straight-line drawing on an integer grid of quadratic size, with the exception of a single edge on the outer face that has one bend. The drawing can be computed in linear time from any...
متن کاملGA for straight-line grid drawings of maximal planar graphs
osting by E Abstract 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. Finding algorithms for straight-line grid drawings of maximal planar graphs (MPGs) in the minimum area is still an elusive goal. In this paper we explore t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2011
ISSN: 1526-1719
DOI: 10.7155/jgaa.00233