Loading…
Overlap-free labeling of clustered networks based on Voronoi tessellation
Properly drawing clustered networks significantly improves the visual readability of the meaningful structures hidden behind the associated abstract relationships. Nonetheless, we often degrade the visual quality of such clustered graphs when we try to annotate the network nodes with text labels due...
Saved in:
Published in: | Journal of visual languages and computing 2018-02, Vol.44, p.106-119 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Properly drawing clustered networks significantly improves the visual readability of the meaningful structures hidden behind the associated abstract relationships. Nonetheless, we often degrade the visual quality of such clustered graphs when we try to annotate the network nodes with text labels due to their unwanted mutual overlap. In this paper, we present an approach for aesthetically sparing labeling space around nodes of clustered networks by introducing a space partitioning technique. The key idea of our approach is to adaptively blend an aesthetic network layout based on conventional criteria with that obtained through centroidal Voronoi tessellation. Our technical contribution lies in choosing a specific distance metric in order to respect the aspect ratios of rectangular labels, together with a new scheme for adaptively exploring the proper balance between the two network layouts around each node. Centrality-based clustering is also incorporated into our approach in order to elucidate the underlying hierarchical structure embedded in the given network data, which also allows for the manual design of its overall layout according to visual requirements and preferences. The accompanying experimental results demonstrate that our approach can effectively mitigate visual clutter caused by the label overlaps in several important types of networks. |
---|---|
ISSN: | 1045-926X 1095-8533 |
DOI: | 10.1016/j.jvlc.2017.09.008 |