Thirty Essays on Geometric Graph Theory pp 461-482 | Cite as

# Realizability of Graphs and Linkages

## Abstract

We show that deciding whether a graph with given edge lengths can be realized by a straight-line drawing has the same complexity as deciding the truth of sentences in the existential theory of the real numbers, ETR; we introduce the class \(\exists \mathbb{R}\) that captures the computational complexity of ETR and many other problems. The graph realizability problem remains \(\exists \mathbb{R}\)-complete if all edges have unit length, which implies that recognizing unit distance graphs is \(\exists \mathbb{R}\)-complete. We also consider the problem for *linkages*: In a realization of a linkage, vertices are allowed to overlap and lie on the interior of edges. Linkage realizability is \(\exists \mathbb{R}\)-complete and remains so if all edges have unit length. A linkage is called *rigid* if any slight perturbation of its vertices that does not break the linkage (i.e., keeps edge lengths the same) is the result of a rigid motion of the plane. Testing whether a configuration is not rigid is \(\exists \mathbb{R}\)-complete.

## Keywords

Existential Theory Graph Drawing Graph Realizability Euclidean Dimension Nontrivial Zero## Notes

## References

- 1.T.G. Abbott, Generalizations of Kempe’s universality theorem. Master’s thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, Cambridge, MA, 2008Google Scholar
- 2.S. Basu, R. Pollack, M.-F. Roy, Algorithms in real algebraic geometry, in
*Algorithms and Computation in Mathematics*, vol. 10, 2nd edn. (Springer, Berlin, 2006)Google Scholar - 3.D. Bienstock, Some provably hard crossing number problems. Discrete Comput. Geom.
**6**(5), 443–459 (1991)MathSciNetzbMATHCrossRefGoogle Scholar - 4.A. Björner, M.L. Vergnas, B. Sturmfels, N. White, G.M. Ziegler, Oriented matroids, in
*Encyclopedia of Mathematics and Its Applications*, vol. 46, 2nd edn. (Cambridge University Press, Cambridge, 1999)Google Scholar - 5.J. Blömer, A probabilistic zero-test for expressions involving roots of rational numbers, in
*Algorithms—ESA ’98 (Venice)*. Lecture Notes in Computer Science, vol. 1461 (Springer-Verlag, Berlin, 1998), pp. 151–162Google Scholar - 6.L. Blum, M. Shub, S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc. (N.S.)
**21**(1), 1–46 (1989)Google Scholar - 7.S. Cabello, E.D. Demaine, G. Rote, Planar embeddings of graphs with specified edge lengths. J. Graph Algorithm. Appl.
**11**(1), 259–276 (electronic) (2007)Google Scholar - 8.J. Canny, Some algebraic and geometric computations in pspace, in
*STOC ’88: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing*(ACM, New York, 1988), pp. 460–469Google Scholar - 9.V. Chvátal, D.A. Klarner, D.E. Knuth, Selected combinatorial research problems. Technical Report STAN-CS-72-292, Computer Science Department, Stanford University, Palo Alto, CA, 1972Google Scholar
- 10.R. Connelly, E.D. Demaine, Geometry and topology of polygonal linkages, in
*Handbook of Discrete and Computational Geometry*, ed. by J.E. Goodman, J. O’Rourke (CRC Press, West Palm Beach, FL, 2004)Google Scholar - 11.E.D. Demaine, J. O’Rourke,
*Geometric Folding Algorithms*(Cambridge University Press, Cambridge, 2007); Linkages, origami, polyhedraGoogle Scholar - 12.G. Di Battista, L. Vismara, Angles of planar triangular graphs. SIAM J. Discrete Math.
**9**(3), 349–359 (1996)MathSciNetzbMATHCrossRefGoogle Scholar - 13.P. Eades, N.C. Wormald, Fixed edge-length graph drawing is NP-hard. Discrete Appl. Math.
**28**(2), 111–134 (1990)MathSciNetzbMATHCrossRefGoogle Scholar - 14.D. Eppstein, Unit distance graphs (2010), Blog posting at http://11011110.livejournal.com/188807.html. Accessed 10 September 2010
- 15.P. Erdős, M. Simonovits, On the chromatic number of geometric graphs. Ars Combin.
**9**, 229–246 (1980)MathSciNetGoogle Scholar - 16.P. Erdős, F. Harary, W.T. Tutte, On the dimension of a graph. Mathematika
**12**, 118–122 (1965)MathSciNetCrossRefGoogle Scholar - 17.X. Gao, C. Zhu, Automated generation of Kempe linkage and its complexity. J. Comput. Sci. Tech.
**14**(5), 460–467 (1999)MathSciNetzbMATHCrossRefGoogle Scholar - 18.J.E. Goodman, J. O’Rourke (eds.),
*Handbook of Discrete and Computational Geometry*, 2nd edn. Discrete Mathematics and Its Applications (Chapman & Hall/CRC, Boca Raton, FL, 2004)Google Scholar - 19.J.E. Goodman, R. Pollack, B. Sturmfels, Coordinate representation of order types requires exponential storage, in
*STOC ’89: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing*(ACM, New York, 1989), pp. 405–410Google Scholar - 20.D.Yu. Grigor’ev, N.N. Vorobjov, Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput.
**5**(1–2), 37–64 (1988)Google Scholar - 21.S.L. Greitzer, H.S.M. Coxeter,
*Geometry Revisited*(The Mathematical Association of America, Washington, DC, 1967)zbMATHGoogle Scholar - 22.H. Hong. Comparison of several decision algorithms for the existential theory of the reals. Technical Report 91–41, RISC-Linz, Johannes Kepler University, Linz, 1991Google Scholar
- 23.D. Jordan, M. Steiner, Configuration spaces of mechanical linkages. Discrete Comput. Geom.
**22**(2), 297–315 (1999)MathSciNetzbMATHCrossRefGoogle Scholar - 24.M. Kahle, Algorithm for embedding a graph with metric constraints, 2010. Posting on mathoverflow at http://mathoverflow.net/questions/33043. Accessed 9 Sept 2010
- 25.M. Kapovich, J.J. Millson, Universality theorems for configuration spaces of planar linkages. Topology
**41**(6), 1051–1107 (2002)MathSciNetzbMATHCrossRefGoogle Scholar - 26.A.B. Kempe, How to draw a straight line.
*Classics in Mathematics Education*(MacMillan, London, 1977)Google Scholar - 27.P. Koiran, The complexity of local dimensions for constructible sets. J. Complexity
**16**(1), 311–323 (2000); Real computation and complexity (Schloss Dagstuhl, 1998)Google Scholar - 28.M. Laurent, A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems. Topics in semidefinite and interior-point methods (Toronto, ON, 1996), in
*Fields Institute of Communication*, vol. 18 (Amer. Math. Soc., Providence, RI, 1998), pp. 51–76Google Scholar - 29.P. Lemke, S.S. Skiena, W.D. Smith, Reconstructing sets from interpoint distances. Discrete and computational geometry, in
*Algorithms Combination*, vol. 25 (Springer, Berlin, 2003), pp. 507–631Google Scholar - 30.D. Little, Peaucellier’s linkage (2005), Applet at 9 october 2012 http://www.math.psu.edu/dlittle/java/parametricequations/linkage.html. Accessed 21 Sept 2012
- 31.H. Maehara, Note on induced subgraphs of the unit distance graph
*E*^{n}. Discrete Comput. Geom.**4**(1), 15–18 (1989)MathSciNetzbMATHCrossRefGoogle Scholar - 32.C.J.H. McDiarmid, T. Müller, The number of bits needed to represent a unit disk graph. Graph-theoretic concepts in computer science. Lecture Notes in Comput. Sci. vol. 6410 (Springer, Berlin, 2010), pp. 315–323 http://dx.doi.org/10.1007/978-3-642-16926-7_29
- 33.B. Mishra, Computational real algebraic geometry, in
*Handbook of Discrete and Computational Geometry*, CRC Press Ser. Discrete Math. Appl. (CRC Press, Boca Raton, FL, 1997), pp. 537–556Google Scholar - 34.N. E. Mnëv, The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. Topology and Geometry—Rohlin Seminar, in
*Lecture Notes in Mathematics*, vol. 1346 (Springer-Verlag, Berlin, 1988), pp. 527–543Google Scholar - 35.C.H. Papadimitriou,
*Computational Complexity*(Addison-Wesley, Reading, MA, 1994)zbMATHGoogle Scholar - 36.J. Renegar, On the computational complexity and geometry of the first-order theory of the reals. I. Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. J. Symbolic Comput.
**13**(3), 255–299 (1992)MathSciNetzbMATHGoogle Scholar - 37.J. Renegar, On the computational complexity and geometry of the first-order theory of the reals. II. The general decision problem. Preliminaries for quantifier elimination. J. Symbolic Comput.
**13**(3), 301–327 (1992)MathSciNetzbMATHGoogle Scholar - 38.J. Renegar, On the computational complexity and geometry of the first-order theory of the reals. III. Quantifier elimination. J. Symbolic Comput.
**13**(3), 329–352 (1992)MathSciNetzbMATHCrossRefGoogle Scholar - 39.J. Richter-Gebert, Mnëv’s universality theorem revisited. Sém. Lothar. Combin.
**34**(1995)Google Scholar - 40.J.B. Saxe, Embeddability of weighted graphs in
*k*-space is strongly NP-hard, in*Seventeenth Annual Allerton Conference on Communication, Control, and Computing, Proceedings of the Conference held in Monticello, Ill.*, Urbana, 1979. University of Illinois Department of Electrical Engineering. Proceedings of the International School of Physics “Enrico Fermi”, LXX*, pp. xiv+1036, 10–12 October 1979Google Scholar - 41.M. Schaefer, Complexity of some geometric and topological problems, in
*Graph Drawing*, ed. by D. Eppstein, E.R. Gansner. Lecture Notes in Computer Science, vol. 5849 (Springer, Berlin, 2009), pp. 334–344Google Scholar - 42.M. Schaefer, D. Štefankovič, Fixed points, Nash equilibria, and the existential theory of the reals. Unpublished manuscript.Google Scholar
- 43.P.W. Shor, Stretchability of pseudolines is NP-hard. Applied geometry and discrete mathematics, in
*DIMACS Series in Discrete Mathematical and Theoretical Computer Science*, vol. 4 (Amer. Math. Soc., Providence, RI, 1991), pp. 531–554Google Scholar - 44.M. Sipser,
*Introduction to the Theory of Computation*, 2nd edn. (Course Technology, Boston, 2005)Google Scholar - 45.A. Soifer,
*The Mathematical Coloring Book*(Springer, New York, 2009); Mathematics of coloring and the colorful life of its creators, With forewords by Branko Grünbaum, Peter D. Johnson, Jr. and Cecil RousseauGoogle Scholar - 46.J.J. Sylvester, On recent discoveries in mechanical conversion of motion, in
*Proceedings of the Royal Institution of Great Britain*, London, 1875, pp. 179–198; Talk delivered 23 January 1874Google Scholar - 47.L.A. Székely, A successful concept for measuring non-planarity of graphs: the crossing number. Discrete Math.
**276**(1–3), 331–352 (2004)MathSciNetzbMATHCrossRefGoogle Scholar - 48.S. Whitesides, Algorithmic issues in the geometry of planar linkage movement. Australian Comput. J.
**24**(2), 42–50 (1992)Google Scholar - 49.Y. Yemini, Some theoretical aspects of position-location problems, in
*20th Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, 1979)*(IEEE, New York, 1979), pp. 1–8Google Scholar