The rectilinear local crossing number of a graph G denoted lcr^_(G), is the minimum local crossing number over all rectilinear drawings of G. Ábrego and Fernández-Merchant determined the rectilinear crossing number of the complete graph K_n to be lcr^_(K_n) = {4 | for n = 8 15 | for n = 14 ⌈1/2(n - 3 - ⌈(n - 3)/3 ⌉)⌈(n - 3)/2 ⌉⌉ | otherwise, auto right match where ⌈x⌉ denotes the ceiling function.

graph crossing number | k-planar graph | local crossing number | rectilinear crossing number