16 citations · 106 across the 45 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
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…
cs.DM2008★ 10 cited
Untangling planar graphs from a specified vertex position - Hard cases
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky +2
Given a planar graph , we consider drawings of in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by…