Who needs crossings? Hardness of plane graph rigidity
From MaRDI portal
Publication:3132834
Recommendations
- Realizability of graphs and linkages
- Connected rigidity matroids and unique realizations of graphs
- Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
- Rigid realizations of graphs with few locations in the plane
- Planar Embeddings of Graphs with Specified Edge Lengths
Cited in
(14)- Unit-length rectangular drawings of graphs
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Enumerating grid layouts of graphs
- Unit-length rectangular drawings of graphs
- The complexity of the Hausdorff distance
- A tight bound for the number of edges of matchstick graphs
- Realizability of graphs and linkages
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- A practical algorithm with performance guarantees for the art gallery problem
- The complexity of drawing a graph in a polygonal region
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
- Smoothing the Gap Between NP and ER
This page was built for publication: Who needs crossings? Hardness of plane graph rigidity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132834)
