Skip to Main content Skip to Navigation
Conference papers

Node Overlap Removal for 1D Graph Layout

Abstract : Energy based algorithms are powerful techniques for laying out graphs. They tend to generate aesthetically pleasing graph embeddings, exhibiting symmetries and community structures. When dealing with large graphs, an important drawback of these algorithms is to produce embeddings where many nodes overlap, leading to cluttering issues. While several approaches have been proposed for node overlap removal on 2D graph layouts, to the best of our knowledge, there is no work dedicated to 1D graph layouts. In this paper, we first define 4 requirements for 1D graph node overlap removal. Then, we propose a O(|V|log(|V|)) time algorithm meeting these requirements. We illustrate our approach with two case studies based on arc diagrams where nodes are positioned by applying a MDS technique to highlight community structures. Finally, we compare our technique with alternatives from 2D graph techniques, and a discussion highlights some properties of the results.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Pascal Poncelet Connect in order to contact the contributor
Submitted on : Thursday, July 13, 2017 - 9:01:59 AM
Last modification on : Friday, August 5, 2022 - 3:02:49 PM
Long-term archiving on: : Thursday, January 25, 2018 - 1:19:28 AM


Files produced by the author(s)



Samiha Fadloun, Pascal Poncelet, Julien Rabatel, Mathieu Roche, Arnaud Sallaberry. Node Overlap Removal for 1D Graph Layout. IV: Information Visualisation, Jul 2017, London, United Kingdom. pp.224-229, ⟨10.1109/iV.2017.14⟩. ⟨lirmm-01542283v2⟩



Record views


Files downloads