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...
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: | |
Online Access: | Get fulltext |
Similar Items
-
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
by: Demaine, Erik D., et al.
Published: (2015) -
Folding equilateral plane graphs
by: Abel, Zachary Ryan, et al.
Published: (2012) -
Who Needs Crossings? Hardness of Plane Graph Rigidity
by: Abel, Zachary R, et al.
Published: (2017) -
Folding equilateral plane graphs
by: Abel, Zachary R., et al.
Published: (2020) -
On the edge irregularity strength for some classes of plane graphs
by: Ibrahim Tarawneh, et al.
Published: (2021-01-01)