Abstract
The small screens on increasingly used mobile devices challenge the traditional visualization methods designed for desktops. This paper presents a method called “Radial Edgeless Tree” (RELT) for visualizing trees in a 2-dimensional space. It combines the existing connection tree drawing with the space-filling approach to achieve the efficient display of trees in a small geometrical area, such as the screen that are commonly used in mobile devices. We recursively calculate a set of non-overlapped polygonal nodes that are adjacent in the hierarchical manner. Thus, the display space is fully used for displaying nodes, while the hierarchical relationships among the nodes are presented by the adjacency (or boundary-sharing) of the nodes. It is different from the other traditional connection approaches that use a node-link diagram to present the parent-child relationships which waste the display space. The hierarchy spreads from north-west to south-east in a top-down manner which naturally follows the traditional way of human perception of hierarchies. We discuss the characteristics, advantages and limitations of this new technique and suggestions for future research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
Eades, P.: Drawing Free Trees, Bulletin of the Institute for Combinatorics and Its Applications, pp.10-36 (1992)
Herman, I., Melançon, G., Marshall, M.S.: Graph Visualization in Information Visualization: a Survey. IEEE Transactions on Visualization and Computer Graphics, 24–44 (2000)
Jeong, C.S, Pang, A.: Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space. In: InfoVis 1998. Proc. 1998 IEEE Symposium on Information Visualization, pp. 19–25. IEEE CS Press, Los Alamitos (1998)
Johnson, B., Shneiderman, B.: Tree-maps: A Space-filling Approach to the Visualization of Hierarchical Information Structures. In: Proc. 1991 IEEE Symposium on Visualization, pp. 284–291. IEEE, Piscataway, NJ (1991)
Lin, C.C., Yen, H.C.: On Balloon Drawings of Rooted Trees. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 285–296. Springer, Heidelberg (2006)
Nguyen, Q.V., Huang, M.L.: A Space-Optimized Tree Visualization. In: InfoVis 2002. Proc. 2002 IEEE Symposium on Information Visualization, pp. 85–92. IEEE Computer Society Press, Los Alamitos (2002)
Reingold, E.M., Tilford, J.S.: Tidier Drawing of Trees. IEEE Trans. Software Eng. 7(2), 223–228 (1981)
Shneiderman, B.: Treemaps for Space-Constrained Visualization of Hierarchies (December 26, 1998) (last updated April 26, 2006), http://www.cs.umd.edu/hcil/treemap-history/
Yang, J., Ward, M.O., Rundensteiner, E.A.: InterRing: An Interactive Tool for Visually Navigating and Manipulating Hierarchical Structures. In: InfoVis 2002. Proc. 2002 IEEE Symposium on Information Visualization, pp. 77–84. IEEE Computer Society Press, Los Alamitos (2002)
Yee, K.P., Fisher, D., Dhamija, R., Hearst, M.: Animated Exploration of Dynamic Graphs with Radial Layout. In: InfoVis 2001. Proc. 2001 IEEE Symposium on Information Visualization, San Diego, CA, USA, pp. 43–50. IEEE Computer Society Press, Los Alamitos (2001)
Yoo, H.Y., Cheon, S.H.: Visualization by Information Type on Mobile Devices. In: Proc. 2006 Asia-Pacific Symposium on Information Visualization, vol. 60, pp. 143–146 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hao, J., Zhang, K., Huang, M.L. (2007). RELT – Visualizing Trees on Mobile Devices. In: Qiu, G., Leung, C., Xue, X., Laurini, R. (eds) Advances in Visual Information Systems. VISUAL 2007. Lecture Notes in Computer Science, vol 4781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76414-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-76414-4_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76413-7
Online ISBN: 978-3-540-76414-4
eBook Packages: Computer ScienceComputer Science (R0)