A space of layout styles for hierarchical graph models of software systems

Proceedings SoftVis '05 - ACM Symposium on Software Visualization

Volumn , Issue , 2005, Pages 155-164

  Noack, Andreas ^a   Lewerentz, Claus ^a  

^a BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Clustering; Focus + context; Force directed methods; Graph drawing; Information visualization; Program understanding; Refactoring; Reverse engineering; Software visualization

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; REVERSE ENGINEERING; SYSTEMS ANALYSIS;

CLUSTERING; FOCUS + CONTEXT; FORCE-DIRECTED METHODS; INFORMATION VISUALIZATION; PROGRAM UNDERSTANDING; REFACTORING; SOFTWARE VISUALIZATION;

COMPUTER SOFTWARE;

EID: 28044442694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1056018.1056040     Document Type: Conference Paper

References (42)

1. BALZER, M., NOACK, A., DEUSSEN, O., AND LEWERENTZ, C. 2004. Software landscapes: Visualizing the structure of large software systems. In Proc. Symposium on Visualization (VisSym 2004), 261-266.
2. BARNES, J., AND HUT, P. 1986. A hierarchical O(N log N) force-calculation algorithm. Nature 324, 446-449.
3. BARTRAM, L., HO, A., DILL, J., AND HENIGMAN, F. 1995. The continuous zoom: A constrained fisheye technique for viewing and navigating large information spaces. In Proc. 8th ACM Symposium on User Interface Software and Technology (UIST1995), 207-215.
4. BRANDES, U. 2001. Drawing on physical analogies. In Drawing Graphs: Methods and Models, M. Kaufmann and D. Wagner, Eds., LNCS 2025. Springer-Verlag, Berlin, 71-86.
5. BUCHSBAUM, A. L., AND WESTBROOK, J. 2000. Maintaining hierarchical graph views. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), 566-575.
6. CARD. S. K., MACKINLAY, J. D., AND SHNEIDERMAN, B. 1999. Readings in Information Visualization: Using Vision to Think. Morgan Kaufmann.
7. COLLBERG, C. S., KOBOUROV, S. G., NAGRA, J., PITTS, J., AND WAMPLER, K. 2003. A system for graph-based visualization of the evolution of software. In Proc. ACM Symposium on Software Visualization (SoftVis 2003), 77-86.
8. DAVIDSON, R., AND HAREL, D. 1996. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 15, 4, 301-331.
9. DI BATTISTA, G., EADES. P., TAMASSIA. R., AND TOLLIS. I. G. 1999. Graph Drawing: Algorithms for the Visualisation of Graphs. Prentice Hall.
10. DIEHL, S., AND GÖRG. C. 2002. Graphs, they are changing. In Proc. 10th International Symposium on Graph Drawing (GD 2002). Springer-Verlag, LNCS 2528, 23-30.
11. EADES, P., AND HUANG, M. L. 2000. Navigating clustered graphs using force-directed methods. Journal of Graph Algorithms and Applications 4, 3, 157-181.
12. EADES, P. 1984. A heuristic for graph drawing. Congressus Numerantium 42, 149-160.
13. FINNIGAN, P. J., HOLT, R. C., KALAS, I., KERR, S., KONTOGIANNIS, K., MÜLLER, H. A., MYLOPOULOS, J., PERELGUT, S. G., STANLEY, M., AND WONG, K. 1997. The software bookshelf. IBM Systems Journal 36, 4, 564-593.
14. FOWLER, M. 2001. Reducing coupling. IEEE Software 18, 4, 102-104.
15. FRISHMAN, Y., AND TAL, A. 2004. Dynamic drawing of clustered graphs. In Proc. IEEE Symposium on Information Visualization (InfoVis 2004), 191-198.
16. FRUCHTERMAN, T. M. J., AND REINGOLD, E. M. 1991. Graph drawing by force-directed placement. Software - Practice and Experience 21, 11, 1129-1164.
17. FURNAS, G. W. 1986. Generalized fisheye views. In Proc. ACM SIGCHI Conference on Human Factors in Computing Systems (CHI 1986), 16-23.
18. HUANG, M. L. 1999. Online Information Visualization of Huge Data Spaces. PhD thesis, Department of Computer Science and Software Engineering. University of Newcastle.
19. KAMADA, T., AND KAWAI, S. 1989. An algorithm for drawing general undirected graphs. Information Processing Letters 31. 1, 7-15.
20. KOSCHKE, R. 2000. Atomic Architectural Component Recovery for Program Understanding and Evolution. PhD thesis, Institut für Informatik. Universität Stuttgart.
21. LINTERN, R., MICHAUD, J., STOREY, M.-A. D., AND Wu, X. 2003. Plugging-in visualization: Experiences integrating a visualization tool with Eclipse. In Proc. ACM Symposium on Software Visualisation (SoftVis 2003), 47-56.
22. MISUE, K., EADES, P., LAI, W., AND SUGIYAMA, K. 1995. Layout adjustment and the mental map. Journal of Visual Languages and Computing 6, 2, 183-210.
23. MÜLLER. H. A., ORGUN, M. A., TILLEY, S. R., AND UHL, J. S. 1993. A reverse engineering approach to subsystem structure identification. Journal of Software Maintenance: Research and Practice 5, 4, 181-204.
24. MURPHY, G. C., NOTKIN, D., AND SULLIVAN, K. J. 2001. Software reflexion models: Bridging the gap between design and implementation. IEEE Transactions on Software Engineering 27, 4, 364-380.
25. NOACK, A. 2004. An energy model for visual graph clustering. In Proc. 11th International Symposium on Graph Drawing (GD 2003), Springer-Verlag, LNCS 2912, 425-436.
26. NOACK, A. 2004. Visual clustering of graphs with nonuniform degrees. Tech. Rep. 02/04, Institute of Computer Science, Brandenburg University of Technology at Cottbus.
27. NOIK, E. G. 1993. Layout-independent fisheye views of nested graphs. In Proc. IEEE Workshop on Visual Languages (Vl. 1993), 336-341.
28. NORTH, S. C., AND WOODHULL, G. 2002. Online hierarchical graph drawing. In Proc. 9th International Symposium on Graph Drawing (GD 2001), Springer-Verlag. LNCS 2265, 232-246.
29. PARKER, G., FRANCK, G., AND WARE, C. 1998. Visualization of large nested graphs in 3d: Navigation and interaction. Journal of Visual Languages and Computing 9, 3, 299-317.
30. PENNY, D. A. 1992. The Software Landscape: A Visual Formalism for Programming-in-the-Large. PhD thesis. Department of Computer Science, University of Toronto.
31. QUIGLEY, A. J., AND EADES, P. 2001. FADE: Graph drawing, clustering, and visual abstraction. In Proc. 8th International Symposium on Graph Drawing (GD 2000), Springer-Verlag, LNCS 1984, 197-210.
32. REISS, S. P. 1995. An engine for the 3d visualization of program information. Journal of Visual Languages and Computing 6, 3, 299-323.
33. SARKAR, M., AND BROWN, M. H. 1994. Graphical fisheye views. Communications of the ACM 37, 12. 73-84.
34. SCHAFFER. D., Zuo, Z., GREENBERG, S., BARTRAM. L., DILL, J., DUBS, S., AND ROSEMAN, M. 1996. Navigating hierarchically clustered networks through fisheye and full-zoom methods. ACM Transactions on Computer-Human Interaction 3, 2, 162-188.
35. SHNEIDERMAN, B. 1992. Tree visualization with tree-maps: A 2-d space-filling approach. ACM Transactions on Graphics 11, 1, 92-99.
36. STOREY, M.-A. D., FRACCHIA, F. D., AND MüLLER, H. A. 1999. Customizing a fisheye view algorithm to preserve the mental map. Journal of Visual Languages and Computing 10. 3, 245-267.
37. SUGIYAMA, K., AND MISUE, K. 1991. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics 21, 4, 876-892.
38. SUGIYAMA, K., AND MISUE, K. 1995. Graph drawing by the magnetic spring model. Journal of Visual Languages and Computing 6, 3, 217-231.
39. VAN HAM, F., AND VAN WIJK, J. J. 2004. Interactive visualization of small world graphs. In Proc. IEEE Symposium on Information Visualisation (InfoVis 2004), 199-206.
40. VAN LIERE, R., AND DE LEEUW, W. 2003. GraphSplatting: Visualizing graphs as continuous fields. IEEE Transactions on Visualization and Computer Graphics 9, 2, 206-212.
41. WANG, X., AND MIYAMOTO, I. 1996. Generating customized layouts. In Proc. Symposium on Graph Drawing (GD 1995), Springer. LNCS 1027, 504-515.
42. WARE, C., FRANCK, G., PARKHI, M., AND DUDLEY, T. 1997. Layout for visualizing large software structures in 3d. In Proc. 2nd International Conference on Visual Information Systems (VISUAL 1997), 215-223.