Abstract
We present an iterative drawing algorithm for undirected graphs, based on a force-directed approach, that preserves edge-crossing properties. This algorithm ensures that two edges cross in the final drawing if and only if these edges crossed in the initial layout. Therefore no new edge crossings are introduced. We describe applications of this technique to improve classical algorithms for drawing planar graphs and for dynamic graph drawing.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
