Abstract
This paper presents a connection between the problem of drawing a graph with the minimum number of edge crossings, and the theory of arrangements of pseudolines, a topic well-studied by combinatorialists. In particular, we show that any given arrangement can be forced to occur in every minimum crossing drawing of an appropriate graph. Using some recent results of Goodman, Pollack, and Sturmfels, this yields that there exists no polynomial-time algorithm for producing a straight-line drawing of a graph, which achieves the minimum number of crossings from among all such drawings. While this result has no bearing on the P versus NP question, it is fairly negative with regard to applications. We also study the problem of drawing a graph with polygonal edges, to achieve the (unrestricted) minimum number of crossings. Here we obtain a tight bound on the smallest number of breakpoints which are required in the polygonal lines.
Article PDF
Similar content being viewed by others
References
D. Bienstock and N. Dean, Bounds on rectilinear crossing numbers, submitted.
D. Bienstock and N. Dean, New results on polygonal crossing numbers, submitted.
H. deFraysseix, R. Pollack, and J. Pach, Small sets supporting Fáry embeddings of planar graphs,Proc. 20th STOC (1988), pp. 426–433.
P. Erdös and R. K. Guy, Crossing number problems,Amer. Math. Monthly 80 (1973), 52–58.
M. R. Garey and D. S. Johnson, Crossing number is NP-complete,SIAM J Algebraic Discete Methods 4 (1983), 312–316.
J. E. Goodman, Proof of a conjecture of Burr, Grünbaum, and Sloane,Discrete Math. 32 (1980), 27–35.
J. E. Goodman and R. Pollack, On the combinatorial classification of nondegenerate configurations in the plane,J. Combin. Theory Ser. A 29 (1980), 230–235.
J. E. Goodman and R. Pollack, Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines,J. Combin. Theory Ser. A 29 (1980) 385–390.
J. E. Goodman and R. Pollack, Multidimensional sorting.SIAM J. Comput. 12 (1983), 484–501.
J. E. Goodman and R. Pollack, Semispaces of configurations, cell complexes of arrangements,J. Combin. Theory Ser. A 37 (1984), 257–293.
J. E. Goodman and R. Pollack, Polynomial realization of pseudoline arrangements,Comm. Pure Appl. Math. XXXVIII (1985), 725–732.
J. E. Goodman and R. Pollack, There are asymptotically fewer polytopes than we thought,Bull. Amer. Math. Soc. 14 (1986), 127–129.
J. E. Goodman and R. Pollack, Upper bounds for configurations and polytopes in ℝd,Discrete Comput. Geom. 1 (1986), 229–237.
J. E. Goodman, R. Pollack, and B. Sturmfels, Coordinate representation of order types requires exponential storage,Proc. 22st STOC (1989), pp. 405–410.
B. Grünbaum,Arrangements and Spreads, CBMS Regional Conference Series in Applied Mathematics, Vol. 10, American Mathematical Society, Providence, RI (1972).
J. Kratochvil and J. Matousek, Intersection graphs of segments, submitted.
F. T. Leighton,Complexity Issues in VLSI, MIT Press, Cambridge, MA (1983).
N. E. Mnëv, The universality theorems on the classification problem of configuration varieties and convex polytopes varieties, inTopology and Geometry-Rohlin Seminar (O. Ya. Viro, ed.), Lecture Notes in Mathematics, Vol. 1346, Springer-Verlag, Berlin (1988), pp. 527–544.
G. Ringel, Teilungen der Ebene durch Geraden oder topologische Geraden,Math. Z. 64 (1956), 79–102.
W. Schnyder, Embedding planar graphs on the grid, Preliminary report, Louisiana State University, Baton Rouge.
P. Shor, Stretchability of pseudolines is NP-Hard, Manuscript (1990).
C. Thomassen, Rectilinear drawings of graphs,J. Graph Theory 12 (1988), 335–341.
W. T. Tutte, Toward a theory of crossing numbers,J. Combin. Theory 8 (1970), 45–53.
Author information
Authors and Affiliations
Additional information
This work was partially supported by the Center for Telecommunications Research, Columbia University.
Rights and permissions
About this article
Cite this article
Bienstock, D. Some provably hard crossing number problems. Discrete Comput Geom 6, 443–459 (1991). https://doi.org/10.1007/BF02574701
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574701