@inproceedings{aa937bbbde324ef09f03a37e987b57c8,
title = "Using spring algorithms to remove node overlapping",
abstract = "Cluttered drawings of graphs cannot effectively con- vey the information of graphs. Two issues might cause node overlapping when one draws a picture of a graph. The first issue occurs when applying a layout algorithm for an abstract graph to a practical appli- cation in which nodes are labeled. The second is the changing of a node's size in a dynamic drawing sys- Tem. This paper presents two algorithms, DNLS and ODNLS, for removing the two kinds of overlapping. The algorithms are based on the well-known spring embedder model. The outputs of the algorithms provide the features of spring algorithms. Experi- ments are carried out to compare DNLS and ODNLS to the Force Scan(FS) algorithm and its variants. The results demonstrate the advantages of DNLS and ODNLS in terms of some aesthetic criteria.",
keywords = "Graph drawing, Node overlapping, Spring algorithm",
author = "Wanchun Li and Peter Eades and Nikola Nikolov",
year = "2005",
language = "English",
isbn = "1920682279",
series = "Conferences in Research and Practice in Information Technology Series",
pages = "131--140",
booktitle = "Information Visualisation 2005 - Asia-Pacific Symposium on Information Visualisation, APVIS 2005",
note = "Asia-Pacific Symposium on Information Visualisation, APVIS 2005 ; Conference date: 27-01-2005 Through 29-01-2005",
}