Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics (Q1868837)

A rectilinear drawing of a graph represents the vertices by points in the plane and edges by straight line segments. This paper examines rectilinear drawings of the complete graph that have the fewest possible number of crossing points. The authors give new drawings of the complete graph that have fewer edge crossings than previously known. They also give improved asymptotic results for the rectilinear crossing number.