Lecture Notes in Computer Science Volume 5849, 2010, pp 334-344

Complexity of Some Geometric and Topological Problems

* Final gross prices may vary according to local VAT.

Get Access

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.