Logo

Login | Create Account

A Framework for User-Grouped Circular Drawings

Six, Janet M. and Tollis, Ioannis G. (2004) A Framework for User-Grouped Circular Drawings. [Conference Paper]

Full text not available from this repository.

Abstract

In this paper we introduce a framework for producing circular drawings in which the groupings are user-defined. These types of drawings can be used in applications for telecommunications, computer networks, social network analysis, project management, and more. This fast approach produces drawings in which the user-defined groupings are highly visible, each group is laid out with a low number of edge crossings, and the number of crossings between intra-group and inter-group edges is low.

Item Type:Conference Paper
Classifications:P Styles > P.120 Circular
ID Code:440
Deposited By:Selbach, Anna
Deposited On:06 Dec 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2912&spage=135

Repository Staff Only: item control page

References

M. A. Bernard, On the Automated Drawing of Graphs, Proc. 3rd Caribbean Conf. on Combinatorics and Computing, pp. 43-55, 1994.

F. Brandenburg, Graph Clustering 1: Cycles of Cliques, Proc. GD '97, LNCS 1353, Springer-Verlag, pp. 158-168, 1997.

G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.

U. Dogrusöz, B. Madden and P. Madden, Circular Layout in the Graph Layout Toolkit, Proc. GD '96, LNCS 11909, Springer-Verlag, pp. 92-100, 1997.

P. Eades, A Heuristic for Graph Drawing, Congr. Numer., 42, pp. 149-160, 1984.

P. Eades, Q. Feng and X. Lin, Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs, Proc. GD '96, LNCS 1190, Springer-Verlag, pp. 113-128, 1997.

P. Eades and Q. W. Feng, Multilevel Visualization of Clustered Graphs, Proc. GD '96, LNCS 1190, Springer-Verlag, pp. 101-112, 1997.

P. Eades and Q. W. Feng and H. Nagamochi, Drawing Clustered Graphs on a Orthogonal Grid, Jrnl. of Graph Algorithms and Applications, pp. 3-29, 1999.

C. Esposito, Graph Graphics: Theory and Practice, Comput. Math. Appl., 15(4), pp. 247-53, 1988.

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.

D. Halliday and R. Resnick, Fundamentals of Physics: 3rd Edition Extended, Wiley, New York, NY, 1988.

M. L. Huang and P. Eades, A Fully Animated Interactive System for Clustering and Navigating Huge Graphs, Proc. of GD '98, LNCS 1547, Springer-Verlag, pp. 107-116, 1998.

G. Kar, B. Madden and R. Gilbert, Heuristic Layout Algorithms for Network Presentation Services, IEEE Network, 11, pp.29-36, 1988.

M. Kaufmann and R. Wiese, Maintaining the Mental Map for Circular Drawings, Proc. of GD 2002, LNCS 2528, Springer-Verlag, pp. 12-22, 2002.

A. Kershenbaum, Telecomunications Network Design Algorithms, McGraw-Hill, 1993.

V. Krebs, Visualizing Human Networks, Release 1.0: Esther Dyson's Monthly Report, pp. 1-25, February 12, 1996.

S. Masuda, T. Kashiwabara, K. Nakajima and T. Fujisawa. On the NP-Completeness of a Computer Network Layout Problem, Proc. IEEE 1987 International Symposium on Circuits and Systems, Philadelphia, PA, pp. 292-295, 1987.

S. Mitchell, Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs, Information Processing Letters, 9(5), pp. 229-232, 1979.

H. Purchase, Which Aesthetic has the Gratest Effect on Human Understanding Proc. of GD '97, LNCS 1353, Springer-Verlag, pp. 248-261, 1997.

J. M. Six (Urquhart), Vistool: A Tool For Visualizing Graphs, Ph.D. Thesis, The University of Texas at Dallas, 2000.

J. M. Six and I. G. Tollis, Circular Drawings of Biconnected Graphs, Proc. of ALENEX '99, LNCS 1619, Springer-Verlag, pp.57-73, 1999.

J. M. Six and I. G. Tollis, Circular Drawings of Telecommunication Networks Nikolopoulos, Eds., World Scientific, pp. 313-323, 2000.

J. M. Six and I. G. Tollis, Effective Graph Visualization Via Node Grouping, Software Visualization: From Theory to Practice, The Kluwer Intl. Series in Engineering and Computer Science Vol. 734, K. Zhang Ed., Kluwer Academic Publishers, 2003.

J. M. Six and I. G. Tollis, A Framework for Circular Drawings of Networks, Proc. of GD '99, LNCS 1731, Springer-Verlag, pp. 107-116, 1999.

I. G. Tollis and C. Xia, Drawing Telecomunication Networks, Proc. GD'94, LNCS 894, Springer-Verlag, pp. 206-217, 1994.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.