Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks the condition that objects and their interoccurring relations are represented by means of a planar graph. However, only 4-connected triangulated planar graphs admit a rectangular dual. In this paper we present a linear time algorithm to optimally construct a rectangular layout for a general class of graphs and we discuss a variety of application fields where this approach represents an helpful support for visualization tools.
Visualizing and Managing Network Topologies via Rectangular Dualization / M. Ancona, W. Cazzola, S. Drago, G. Quercini - In: ISCC 2006 : 11. IEEE Symposium on Computers and Communications : proceedings : 26-29 June 2006, Cagliari, Sardinia, Italy / [a cura di] Paolo Bellavista. - Los Alamitos, Ca. : IEEE, 2006. - ISBN 0769525881. - pp. 1000-1005 (( convegno IEEE Symposium on Computers and Communications (ISCC'06) tenutosi a Pula, Sardinia, Italy nel 2006 [10.1109/ISCC.2006.167].
Visualizing and Managing Network Topologies via Rectangular Dualization
W. CazzolaSecondo
;
2006
Abstract
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks the condition that objects and their interoccurring relations are represented by means of a planar graph. However, only 4-connected triangulated planar graphs admit a rectangular dual. In this paper we present a linear time algorithm to optimally construct a rectangular layout for a general class of graphs and we discuss a variety of application fields where this approach represents an helpful support for visualization tools.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
