Abstract
We show that a plane graph can be embedded with its vertices at arbitrarily assigned locations in the plane and at most $6n-1$ bends per edge. This improves and simplifies a classic result by Pach and Wenger. The proof extends to orthogonal drawings.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics