… G is the minimum number of segments in a straight-line drawing of G in the plane. Note that
… line cover in Rd of a graph G, we mean a drawing D of G together with a set L of k lines such …

… of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered
by few lines or planes. … graphs that can be drawn in 3-space on a lot fewer lines than in the …

… We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only …
be covered by few lines or planes. We insist on straightline edges and crossing-free drawings. …

… 13 lines. In this paper, we restrict ourselves to straight-line and crossing-free drawings of
graphs in Rd for d ∈ {2, 3}. Note that a straight-line drawing is completely determined by the …

… in a plane and that we have more flexibility when drawing in … 5, so we need five lines to
cover edges incident to this vertex, that is, 20 lines in total, but we have double-counted the lines …

… that every plane triangulation admits a straight-line drawing with at most ( 7 n − 2 Δ 0 − 10 ) /
… It is straightforward to use our algorithm to draw general plane graphs: Given a plane graph …

… We define the visual complexity of a plane graph drawing to be the number of basic … In
particular, one object may represent multiple edges (eg, one needs only one line segment to draw …

… drawing Γ of a plane graph G, it is NP-hard to determine whether there exists a k-segment
drawing of … (2) In Section 5, we prove that given a partial drawing Γ of a plane graph G, it is NP-…

… -line drawing except for at most one edge [10]; this drawing … that every 1-plane graph
admits a 1-bend drawing as it suf… a straight-line drawing of the resulting plane graph (possible …

… some techniques used in finding good drawings in the plane. A representation of a planar
graph without edge crossings in the plane is called a plane … graph is then called a plane graph…