Two-colour crossing minimization in complete geometric graphs is NP-hard

Given a fixed straight-line drawing of a complete graph, we seek a two-colouring of its edges that minimizes the number of monochromatic crossing pairs. We prove that the threshold decision problem is NP-complete, even when the vertices are in general position and have integer coordinates of polynomial binary length. Thus exact minimization is NP-hard, answering the complexity question posed at the Crossing Number Workshop in 2019. The reduction is from MaxCut on permutation graphs. Its main difficulty is to control the edges required by completeness, whose colours must remain free. We construct a large comparison grid with two stable colour phases and use additional points to assign costs to the edges that encode the source graph. A geometric separation eliminates one large class of unwanted crossings. The costs of all remaining edges are included in a computable baseline and bounded errors, with each unit of the source objective amplified beyond the total error. The construction is deterministic and has polynomial size and coordinate bit length.