Jean Cardinal
Skip Abstract Section
Abstract
In this column, we consider natural problems in computational geometry that are polynomialtime equivalent to finding a real solution to a system of polynomial inequalities. Such problems are called ⇿R-complete, and typically involve geometric graphs. We describe the foundations of those completeness proofs, in particular Mnëv's Universality Theorem, as well as some known ⇿R-completeness results, and recent additions to the list. The results shed light on the complex structure of those problems, beyond mere NP-hardness.
- Timothy G. Abbott. Generalizations of Kempe's universality theorem. Master's thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2008.Google Scholar
- James Abello and Krishna Kumar. Visibility graphs and oriented matroids. Discrete & Computational Geometry, 28(4):449--465, 2002. Google ScholarDigital Library
- Karim A. Adiprasito, Arnau Padrol, and Louis Theran. Universality theorems for inscribed polytopes and delaunay triangulations. Discrete & Computational Geometry, 54(2):412--431, 2015. Google ScholarDigital Library
- Saugata Basu, Richard Pollack, and Marie-Françoise Roy. Existential theory of the reals. In Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics, pages 505--532. Springer Berlin Heidelberg, 2006.Google ScholarCross Ref
- Daniel Bienstock. Some provably hard crossing number problems. Discrete & Computational Geometry, 6(3):443--459, 1991. Google ScholarDigital Library
- Anders Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Günter M. Ziegler. Oriented Matroids. Number 46 in Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2nd edition, 1999.Google Scholar
- Thomas Bläsius, Stephen G. Kobourov, and Ignaz Rutter. Simultaneous embedding of planar graphs. ArXiv e-prints, 2015.Google Scholar
- Jürgen Bokowski, Susanne Mock, and Ileana Streinu. On the Folkman-Lawrence topological representation theorem for oriented matroids of rank 3. European Journal of Combinatorics, 22(5):601--615, 2001. Google ScholarDigital Library
- Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, and Joseph S. B. Mitchell. On simultaneous planar graph embeddings. Computational Geometry, 36(2):117--130, 2007. Google ScholarDigital Library
- Ulrich Brehm. A universality theorem for realization spaces of polyhedral maps. Special seminar on "Universality of moduli spaces and geometry" (06.11.2013) -- Hausdor Research Institute for Mathematics.Google Scholar
- John Canny. Some algebraic and geometric computations in PSPACE. In Symposium on Theory of Computing (STOC), pages 460--467. ACM, 1988. Google ScholarDigital Library
- Jean Cardinal and Udo Hoffmann. Recognition and complexity of point visibility graphs. In Symposium on Computational Geometry (SoCG), pages 171--185, 2015.Google Scholar
- Jean Cardinal and Vincent Kusters. The complexity of simultaneous geometric graph embedding. Journal of Graph Algorithms and Applications, 19(1):259--272, 2015.Google ScholarCross Ref
- Robert Connelly and Erik D. Demaine. Geometry and topology of polygonal linkages. In Handbook of Discrete and Computational Geometry, Second Edition, pages 197--218. CRC Press, 2004.Google ScholarCross Ref
- Jon Folkman and Jim Lawrence. Oriented matroids. Journal of Combinatorial Theory, Series B, 25(2):199--236, 1978.Google ScholarCross Ref
- Subir K. Ghosh and Partha P. Goswami. Unsolved problems in visibility graphs of points, segments, and polygons. ACM Computing Surveys (CSUR), 46(2):22, 2013. Google ScholarDigital Library
- Subir Kumar Ghosh and Bodhayan Roy. Some results on point visibility graphs. Theoretical Computer Science, 575:17--32, 2015. Google ScholarDigital Library
- Jacob E. Goodman, Richard Pollack, and Bernd Sturmfels. Coordinate representation of order types requires exponential storage. In Symposium on Theory of Computing (STOC), pages 405--410. ACM, 1989. Google ScholarDigital Library
- Branko Grünbaum. Convex Polytopes, volume 221 (2nd ed.) of Graduate Texts in Mathematics. Springer-Verlag, 2003.Google Scholar
- Ross J. Kang and Tobias Müller. Sphere and dot product representations of graphs. Discrete & Computational Geometry, 47(3):548--568, 2012. Google ScholarDigital Library
- Michael Kapovich and John J. Millson. Universality theorems for configuration spaces of planar linkages. Topology, 41(6):1051--1107, 2002.Google ScholarCross Ref
- Donald E. Knuth. Axioms and Hulls, volume 606 of Lecture Notes in Computer Science. Springer, 1992.Google Scholar
- Jan Kratochvíl and Jirí Matoušek. Intersection graphs of segments. Journal of Combinatorial Theory, Series B, 62(2):289--315, 1994. Google ScholarDigital Library
- Jan Kynčl. Simple realizability of complete abstract topological graphs in P. Discrete & Computational Geometry, 45(3):383--399, 2011. Google ScholarDigital Library
- Jiří Matoušek. Intersection graphs of segments and 9R. ArXiv e-prints, 2014.Google Scholar
- Colin McDiarmid and Tobias Müller. Integer realizations of disk and segment graphs. Journal of Combinatorial Theory, Series B, 103(1):114--143, 2013. Google ScholarDigital Library
- Nicolai E. Mnëv. Varieties of combinatorial types of projective configurations and convex polyhedra. Dokl. Akad. Nauk SSSR, 283(6):1312--1314, 1985.Google Scholar
- Nicolai E. Mnëv. The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In Topology and geometry -- Rohlin seminar, pages 527--543. Springer, 1988.Google ScholarCross Ref
- Joseph O'Rourke and Ileana Streinu. Vertex-edge pseudo-visibility graphs: Characterization and recognition. In Symposium on Computational Geometry (SoCG), pages 119--128, 1997. Google ScholarDigital Library
- Jürgen Richter-Gebert. Mnëv's universality theorem revisited. In Proceedings of the Séminaire Lotharingien de Combinatoire, pages 211--225, 1995.Google Scholar
- Jürgen Richter-Gebert. Realization spaces of polytopes. Lecture notes in mathematics. Springer-Verlag, 1996.Google ScholarCross Ref
- Igor Rivin. A characterization of ideal polyhedra in hyperbolic 3-space. Annals of Mathematics, 143(1):51--70, 1996.Google ScholarCross Ref
- Bodhayan Roy. Point visibility graph recognition is NP-hard. ArXiv e-prints, 2014.Google Scholar
- Marcus Schaefer. Complexity of some geometric and topological problems. In International Symposium on Graph Drawing (GD), pages 334--344, 2009. Google ScholarDigital Library
- Marcus Schaefer. Realizability of graphs and linkages. In Thirty Essays on Geometric Graph Theory. Springer, 2012.Google Scholar
- Marcus Schaefer and Daniel Štefankovič. Fixed points, Nash equilibria, and the existential theory of the reals. manuscript, 2011.Google Scholar
- Peter W. Shor. Stretchability of pseudolines is NP-hard. Applied Geometry and Discrete Mathematics{The Victor Klee Festschrift, 4:531--554, 1991.Google Scholar
- Karl Georg Christian Staudt. Geometrie der Lage. Nürnberg F. Korn, 1847.Google Scholar
- Ileana Streinu. Non-stretchable pseudo-visibility graphs. Computational Geometry, 31(3):195--206, 2005. Google ScholarDigital Library
Index Terms
- Computational Geometry Column 62
Index terms have been assigned to the content through auto-classification.
Recommendations
The art gallery problem is ∃ ℝ-complete
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingWe prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classic problem in computational geometry, ...
Column: Team Diagonalization
Ten years ago, Gla'er, Pavan, Selman, and Zhang [GPSZ08] proved that if P 6= NP, then all NP-complete sets can be simply split into two NP-complete sets. That advance might naturally make one wonder about a quite di erent potential consequence of NP-...
Computational Complexity of Quantum Satisfiability
We connect both discrete and algebraic complexity theory with the satisfiability problem in certain non-Boolean lattices.
Specifically, quantum logic was introduced in 1936 by Garrett Birkhoff and John von Neumann as a framework for capturing the ...
Comments