Abstract. This paper addresses the following question: Given a planar poly-line drawing of a graph, can we “straighten it out”, i.e., convert it to a planar straight-line drawing, while keeping some features unchanged? We show that any y-monotone poly-line drawing can be straightened out while maintaining y-coordinates and height. The width may increase much, but we also show that on some graphs exponential width is re-quired if we do not want to increase the height. Likewise y-monotonicity is required: there are poly-line drawings (not y-monotone) that cannot be straightened out while maintaining the height. We give some applications of our result
This text focuses on the drawing of graphs. It first sums up the basics of this domain, then focuses...
Let G be a simple topological graph and let Gamma be a polyline drawing of G. We say that Gamma part...
Abstract: A graph is a set of vertices, with some pairwise connections given by a set of edges. A gr...
There are numerous styles of planar graph drawings, such as straight-line drawings, poly-line drawin...
There are numerous styles of planar graph drawings, notably straight-line drawings, poly-line drawin...
Abstract. A straight-line (respectively, polyline) drawing Γ of a planar graph G on a set Lk of k pa...
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawi...
Abstract. Angular resolution, area and the number of bends are some important aesthetic criteria of ...
Angular resolution, area and the number of bends are some important aesthetic criteria of a polyline...
We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such t...
A drawing of a graph is a monotone drawing if for every pair of vertices u and v there is a path dra...
We present a linear time algorithm that produces a planar polyline drawing for a plane graph with $n...
Abstract. We consider embeddings of planar graphs in R2 where ver-tices map to points and edges map ...
Given an n-vertex graph and two straight-line planar drawings of the graph that have the same faces ...
\u3cbr/\u3eWe study the problem of computing straight-line drawings of non-planar graphs with few cr...
This text focuses on the drawing of graphs. It first sums up the basics of this domain, then focuses...
Let G be a simple topological graph and let Gamma be a polyline drawing of G. We say that Gamma part...
Abstract: A graph is a set of vertices, with some pairwise connections given by a set of edges. A gr...
There are numerous styles of planar graph drawings, such as straight-line drawings, poly-line drawin...
There are numerous styles of planar graph drawings, notably straight-line drawings, poly-line drawin...
Abstract. A straight-line (respectively, polyline) drawing Γ of a planar graph G on a set Lk of k pa...
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawi...
Abstract. Angular resolution, area and the number of bends are some important aesthetic criteria of ...
Angular resolution, area and the number of bends are some important aesthetic criteria of a polyline...
We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such t...
A drawing of a graph is a monotone drawing if for every pair of vertices u and v there is a path dra...
We present a linear time algorithm that produces a planar polyline drawing for a plane graph with $n...
Abstract. We consider embeddings of planar graphs in R2 where ver-tices map to points and edges map ...
Given an n-vertex graph and two straight-line planar drawings of the graph that have the same faces ...
\u3cbr/\u3eWe study the problem of computing straight-line drawings of non-planar graphs with few cr...
This text focuses on the drawing of graphs. It first sums up the basics of this domain, then focuses...
Let G be a simple topological graph and let Gamma be a polyline drawing of G. We say that Gamma part...
Abstract: A graph is a set of vertices, with some pairwise connections given by a set of edges. A gr...