We present an iterative drawing algorithm for undirected graphs, based on a force-directed approach, that preserves edge crossing
properties. This algorithm insures that two edges cross in the final drawing if and only if these edges crossed on the initial
layout. So no new edge crossings are introduced. We describe applications of this technique to improve classical algorithms
for drawing planar graphs and for interactive graph drawing.