Navigation techniques for 2.5D graph layout

In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy some of the criteria. In particular, we design and implement methods for trees, clustered graphs and hierarchical graphs drawn in 2.5 dimensions.

• Type: Conference
• Year: 2007
• Where: APVIS
• Authors: Adel Ahmed, Seok-Hee Hong
• Keywords: APVIS 2007, Hierarchical Graphs, Implement Methods, Information Technology, Present Various Methods