Using constraints to achieve stability in automatic graph layout algorithms
CHI '90 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Journal of Information Processing
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editor
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
User Hints for Directed Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Graph Theory With Applications
Graph Theory With Applications
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Journal of Visual Languages and Computing
Graphical representation of defeasible logic rules using digraphs
SETN'06 Proceedings of the 4th Helenic conference on Advances in Artificial Intelligence
Visualizing defeasible logic rules for the semantic web
ASWC'06 Proceedings of the First Asian conference on The Semantic Web
Hi-index | 0.00 |
This paper describes some studies in Human-Computer Interaction for Directed Graph Drawing. We have developed a system where users can help some standard graph drawing algorithms to produce nice drawings of a graph according to a set of aesthetic criteria. The system follows a general framework for interaction with optimisation processes that can be applied to many optimisation problems. Some discussion about the framework and possible improvements is presented.