The first target of the Rectilinear Crossing Number project is completed. We have successfully computed the minimum crossing number of a straight-edge drawing of
the complete graph of a set of 18 points in the plane: CR(18)=1029.
This is what this graph looks like.
Note that this drawing doesn't show a complete graph but only its structure. The reason is that one would not recognize anything if we had drawn all (18 choose 2) edges. This page is only a tentative version. The analysis of the "18"-results is still in progress and we will update this page as soon as we know more...
