4 results for "Steven Chaplick"
Showing 1–4 · 0.56 seconds · RSS
-
Journal Article
Beyond Outerplanarity
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at most k other edges; and outer k-quasi-planar…
-
Journal Article
Drawing graphs on few lines and few planes
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many relations to other challenging graph-drawing problems such as small-area…
-
Journal Article
Placing your coins on a shelf
We consider the problem of packing a family of disks "on a shelf," that is, such that each disk touches the x-axis from above and such that no two disks overlap. We study the problem of minimizing the distance between the leftmost point and the rightmost point of any disk in such a packing. We show…
-
Journal Article
Planar L-Drawings of Directed Graphs
In this paper, we study drawings of directed graphs. We use the L-drawing standard where each edge is represented by a polygonal chain that consists of a vertical line segment incident to the source of the edge and a horizontal line segment incident to the target. First, we consider planar…