Abstract
We consider the problem of drawing an outerplanar graph with n vertices with at most one bend per edge if the outer face is already drawn as a simple polygon with m corners. We prove that it can be decided in O(mn) time if such a drawing exists. In the positive case, our algorithm also outputs such a drawing.
Users
Please
log in to take part in the discussion (add own reviews or comments).