Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...
The work described here extends the power of 2D animation with a form of texture mapping conveniently controlled by line drawings. By tracing points, line segments, spline curves,...