Free Edge Lengths in Plane Graphs

Free Edge Lengths in Plane Graphs

We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the "host" of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a planar straight-line embedding that r...

Full description

Bibliographic Details
Main Authors: Connelly, Robert (Author), Fulek, Radoslav (Author), Morić, Filip (Author), Okamoto, Yoshio (Author), Szabó, Tibor (Author), Tóth, Csaba D. (Author), Abel, Zachary R (Contributor), Eisenstat, Sarah Charmian (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Springer US, 2017-02-10T18:56:05Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items