Logo

Login

User Hints for Directed Graph Drawing

do Nascimento, Hugo A.D. and Eades, Peter (2002) User Hints for Directed Graph Drawing. [Conference Paper]

Full text not available from this repository.

Abstract

This paper investigates an interactive approach where users can help a system to produce nice drawings of directed graphs by giving hints to graph drawing algorithms. Hints can be three kinds of operations: focus on a specific part of the drawing that needs improvement, insertion of layout constraints, and manual changes of the drawing. These hints help the system to escape from local minima, reduce the size of the solution space to be explored, and input domain knowledge. The overall aim is to produce high quality drawings. We present a system based on this approach and a pilot study involving human tests.

Item Type:Conference Paper
Classifications:M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.999 Others
ID Code:511
Deposited By:Arnopolina, Galina
Deposited On:22 Dec 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2265&spage=205

Repository Staff Only: item control page

References

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

2. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man. Cybern., SMC-11(2):109-125, 1981.

3. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, SMC-18(1):61-79, 1988.

4. K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876-892, 1991.

5. Proceedings of the 22nd Annual Conference on Software Engineering ((ICSE 2000). Limerick, Ireland, June 4-11, 2000.

6. Graph Drawing Contest. In J. Marks, editor, Proc. Graph Drawing: 8th International Symposium (GD '00), vol. 1984 of LNCS. Springer, 2001.

7. R. Davidson and D. Harel. Drawing graphs nicely using simmulated annealing. Technical report, Dept. of Appl. Math. and Comp. Sci., 1991.

8. J. Utech, J. Branke, H. Schmeck, and P. Eades. An evolutionary algorithm for drawing directed graphs. In Proc. of the International Conference on Imaging Science, Systems, and Technology (CISST '98), pages 154-160, Las Vegas, Nevada: CSREA Press, July 6-9, 1998.

9. H.A.D. do Nascimento, P. Eades, and C.F. Xavier de Mendoca Neto. A multiagent approach using A-Teams for graph drawing. In Proc. of the 9th International Conference on Intelligent Systems, Louisville, Kentucky, USA, June 15-16, 2000, pages 39-42.

10. D. Andersen, M. Andersen, M. Lesh, J. Marks, B. Mirtich, D. Ratajczac and K. Ryall. Human guided simple search , to appear in the proceedings of the annual conference of zhe American Association for Artifical Intelligent, 2000.

11. N. Lesh, J. Marks, and M. Patrigname. Interactive partitioning, Graph Drawing Conference, 2000.

12. K. Ryall, J. Marks, and S. Shieber. An interactive

constraint-based system for graph drawings. Proc. of the 10th Annu. Symp. on User Interface Software and Technology (UIST '97), Banff, Alberta, pp. 97-104.

13. T.M.J. Fruchtermann and E.M. Reingold. Graph drawing by force-directed placement. Software Practice and Experience, 21(11):1129-1164, November 1991.

14. K. Dauner. Ein interactiver genetischer Algorithmus für das Zeichnen von Graphen. Diplomarbeit. Institute AIFB, University of Karlsruhe, Germany, 1997.

15.A.E. Jacobsen. Interaktion und Lernverhalten beim Zeichnen von Graphen mit Hilfe evolutionarer Algorithmen. Diplomarbeit. Institute AIFB, University of Karlsruhe, Germany, 2001.

16. E. Koutsofios and S.C. North. Drawing graphs with dot. Technical report, At&T, Bell Laboratories, Murray Hill, NJ, USA, Sep 1991.

17. K.-F. Böhringer and F.N. Paulisch. Using constraints to achieve stability in automatic graph layout algorithms. Conference proceedings on Empowering people: Human factors in computing system: special issueof the SIGCHI Bulltein, pages 43-51, 1990.

18. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.

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.