Geometric drawings of Kn with few crossings

We give a new upper bound for the rectilinear crossing number of the complete geometric graph Kn. We prove that by means of a new construction based on an iterative duplication strategy starting with a set having a certain structure of halving lines.