MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Free Edge Lengths in Plane Graphs

Author(s)
Connelly, Robert; Fulek, Radoslav; Morić, Filip; Okamoto, Yoshio; Szabó, Tibor; Tóth, Csaba D.; Abel, Zachary R; Eisenstat, Sarah Charmian; ... Show more Show less
Thumbnail
Download454_2015_9704_ReferencePDF.pdf (467.9Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
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 these lengths; and G is extrinsically free in H if all constraints on the edge lengths of G depend on G only, irrespective of additional edges of the host H. We characterize the planar graphs G that are free in every host H, G⊆H, and all the planar graphs G that are extrinsically free in every host H, G⊆H. The case of cycles G=C[subscript k] provides a new version of the celebrated carpenter’s rule problem. Even though cycles C[subscript k], k≥4, are not extrinsically free in all triangulations, it turns out that “nondegenerate” edge lengths are always realizable, where the edge lengths are considered degenerate if the cycle can be flattened (into a line) in two different ways. Separating triangles, and separating cycles in general, play an important role in our arguments. We show that every star is free in a 4-connected triangulation (which has no separating triangle).
Date issued
2015-05
URI
http://hdl.handle.net/1721.1/106900
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Journal
Discrete & Computational Geometry
Publisher
Springer US
Citation
Abel, Zachary et al. “Free Edge Lengths in Plane Graphs.” Discrete & Computational Geometry 54.1 (2015): 259–289.
Version: Author's final manuscript
ISSN
0179-5376
1432-0444

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.