A New Algorithm for Embedding Plane Graphs at Fixed Vertex Locations
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.
2012 ◽
Vol 21
(14)
◽
pp. 1250129
◽
Keyword(s):
2013 ◽
Vol 23
(02)
◽
pp. 75-92
◽
Keyword(s):
2006 ◽
Vol 17
(05)
◽
pp. 1031-1060
◽
Keyword(s):
2009 ◽
Vol 18
(12)
◽
pp. 1711-1726
◽
Keyword(s):
2019 ◽
Vol 28
(14)
◽
pp. 1950085
Keyword(s):
2007 ◽
Vol 17
(03)
◽
pp. 201-230
◽
Keyword(s):
2018 ◽
Vol 27
(08)
◽
pp. 1850044
Keyword(s):