A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Constrained Point-Set Embeddability of Planar Graphs
[chapter]
2009
Lecture Notes in Computer Science
This paper starts the investigation of a constrained version of the point-set embeddability problem. Let G = (V, E) be a planar graph with n vertices, G = (V , E ) a subgraph of G, and S a set of n distinct points in the plane. We study the problem of computing a point-set embedding of G on S subject to the constraint that G is drawn with straight-line edges. Different drawing algorithms are presented that guarantee small curve complexity of the resulting drawing, i.e. a small number of bends
doi:10.1007/978-3-642-00219-9_35
fatcat:rpmcokecjrauvf7sdsrndkwv54