10 citations · 44 across the 41 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2016
Drawing Graphs on Few Lines and Few Planes
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp +3
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…
cs.CG2008★ 2 cited
On collinear sets in straight line drawings
Alexander Ravsky, Oleg Verbitsky
We consider straight line drawings of a planar graph with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as…