22 search results - page 5 / 5 » Drawings of planar graphs with few slopes and segments |
CCCG
2009
13 years 6 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
COMGEO
2012
ACM
12 years 1 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...