Efficient Node Overlap Removal Using a Proximity Stress ModelGansner, Emden R. and Hu, Yifan (2009) Efficient Node Overlap Removal Using a Proximity Stress Model. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 206-217(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_20). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_20
AbstractWhen drawing graphs whose nodes contain text or graphics, the nontrivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem is to avoid overlaps while retaining the structural information inherent in a layout using little additional area. This paper presents a new node overlap removal algorithm that does well by these measures.
Actions (login required)
|