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 realizes th...

Full description

Bibliographic Details
Main Authors: Connelly, Robert, Fulek, Radoslav, Morić, Filip, Okamoto, Yoshio, Szabó, Tibor, Tóth, Csaba D., Abel, Zachary R, Eisenstat, Sarah Charmian
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: Springer US 2017
Online Access:http://hdl.handle.net/1721.1/106900
https://orcid.org/0000-0002-4295-1117
https://orcid.org/0000-0002-3182-1675

Internet

http://hdl.handle.net/1721.1/106900
https://orcid.org/0000-0002-4295-1117
https://orcid.org/0000-0002-3182-1675

Similar Items