90 search results - page 8 / 18 » Obfuscated Drawings of Planar Graphs |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We introduce the notion of Lombardi graph drawings, named after the abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line seg...
GD
2004
Springer
14 years 3 months ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
ESA
1993
Springer
14 years 1 months ago
1993
Springer
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...