Complexity of Some Geometric and Topological Problems

  • Marcus Schaefer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5849)

Abstract

We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on the rectilinear crossing number and intersection graphs of line segments, we argue that there is a need to recognize this level of complexity as its own class.

References

  1. 1.
    Bienstock, D.: Some provably hard crossing number problems. Discrete Comput. Geom. 6(5), 443–459 (1991)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Björner, A., Vergnas, M.L., Sturmfels, B., White, N., Ziegler, G.M.: Oriented matroids, 2nd edn. Encyclopedia of Mathematics and its Applications, vol. 46. Cambridge University Press, Cambridge (1999)MATHGoogle Scholar
  3. 3.
    Bürgisser, P., Cucker, F.: Counting complexity classes for numeric computations. II. Algebraic and semialgebraic sets. J. Complexity 22(2), 147–191 (2006)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Canny, J.: Some algebraic and geometric computations in pspace. In: STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 460–469. ACM, New York (1988)CrossRefGoogle Scholar
  5. 5.
    Davis, E., Gotts, N.M., Cohn, A.G.: Constraint networks of topological relations and convexity. Constraints 4(3), 241–280 (1999)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Egenhofer, M.J.: Reasoning about binary topological relations. In: Günther, O., Schek, H.-J. (eds.) SSD 1991. LNCS, vol. 525, pp. 143–160. Springer, Heidelberg (1991)Google Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods 4(3), 312–316 (1983)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Goodman, J.E., Pollack, R., Sturmfels, B.: Coordinate representation of order types requires exponential storage. In: STOC 1989: Proceedings of the twenty-first annual ACM symposium on Theory of computing, Seattle, Washington, United States, pp. 405–410. ACM, New York (1989)CrossRefGoogle Scholar
  9. 9.
    Hliněný, P.: Crossing number is hard for cubic graphs. J. Combin. Theory Ser. B 96(4), 455–471 (2006)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Kratochvíl, J.: Personal communicationGoogle Scholar
  11. 11.
    Kratochvíl, J., Matoušek, J.: Intersection graphs of segments. J. Combin. Theory Ser. B 62(2), 289–315 (1994)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Kratochvíl, J., Pergel, M.: Geometric intersection graphs: do short cycles help (extended abstract). In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 118–128. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. 13.
    Kyncl, J.: The complexity of several realizability problems for abstract topological graphs (unpublished manuscript) (based on Graph Drawing 2007 paper) Google Scholar
  14. 14.
    Mnëv, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Topology and geometry—Rohlin Seminar. Lecture Notes in Math., vol. 1346, pp. 527–543. Springer, Berlin (1988)CrossRefGoogle Scholar
  15. 15.
    Pach, J., Tóth, G.: Thirteen problems on crossing numbers. Geombinatorics 9(4), 194–207 (2000)MATHMathSciNetGoogle Scholar
  16. 16.
    Pelsmajer, M.J., Schaefer, M., Štefankovič, D.: Crossing number of graphs with rotation systems. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 3–12. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  17. 17.
    Renz, J.: Qualitative spatial reasoning with topological information. In: Renz, J. (ed.) Qualitative Spatial Reasoning with Topological Information. LNCS (LNAI), vol. 2293, p. 207. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  18. 18.
    Richter-Gebert, J.: Mnëv’s universality theorem revisited. Sém. Lothar. Combin. 34 (1995)Google Scholar
  19. 19.
    Schaefer, M.: The real logic of drawing graphs (unpublished manuscript)Google Scholar
  20. 20.
    Schaefer, M., Sedgwick, E., Štefankovič, D.: Recognizing string graphs in NP. J. Comput. System Sci. 67(2), 365–380 (2003); Special issue on STOC 2002, Montreal, QCMATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Schaefer, M., Štefankovič, D.: Fixed points, nash equilibria, and the existential theory of the reals (unpublished manuscript)Google Scholar
  22. 22.
    Schaefer, M., Štefankovič, D.: Decidability of string graphs. J. Comput. System Sci. 68(2), 319–334 (2004); Special issue on STOC 2001, Crete, GreeceMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Shor, P.W.: Stretchability of pseudolines is NP-hard. In: Applied geometry and discrete mathematics. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 4, pp. 531–554. Amer. Math. Soc., Providence (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Marcus Schaefer
    • 1
  1. 1.DePaul UniversityChicagoUSA

Personalised recommendations