Minimum-change drawings for labeled graphs

Authors:
Michael A. Bekos;Katerina Potika;Antonios Symvonis
Affiliations:
National Technical University of Athens, School of Applied Mathematical & Physical Sciences, Athens, Greece;National Technical University of Athens, School of Applied Mathematical & Physical Sciences, Athens, Greece;National Technical University of Athens, School of Applied Mathematical & Physical Sciences, Athens, Greece
Venue:
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Year:
2007

Citing 5
Cited 0

Point labeling with sliding labels

Computational Geometry: Theory and Applications - Special issue on applications and challenges
Polygon labelling of minimum leader length

APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Multi-stack boundary labeling problems

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Boundary labelling of optimal total leader length

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Boundary labeling: models and efficient algorithms for rectangular maps

GD'04 Proceedings of the 12th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The interest in algorithms that automate the process of information visualization by the usage of textual labels for features of interest within a visualization has increased with the advance in type-setting technology and the amount of information to be visualized. In this paper, we study minimum-change drawings for labeled graphs, adopting the boundary labeling model [6]. Changes within the graph may occur because of the actions of a user, which is able to insert new features within the visualization, delete previously placed features and change the sizes of the labels. Each time the user acts, a small change should be performed within the visualization in order to rearrange its components with respect to some optimization criterion. We model this problem and we also provide several heuristics to obtain "near-optimal" solutions.