34 search results - page 4 / 7 » Orthogonal Drawings of Plane Graphs without Bends |
GD
2007
Springer
15 years 3 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
COMGEO
2002
ACM
14 years 9 months ago
2002
ACM
96
Voted
JGAA
2008
14 years 9 months ago
2008
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...
VLC
2002
14 years 9 months ago
2002
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
COMGEO
2007
ACM
14 years 9 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...