DocumentCode :
2410837
Title :
Heuristics for edge drawing in a graph-based visual language
Author :
Ibrahim, Bertrand ; Randriamparany, Honitriniela ; Yoshizumi, Hidenon
Author_Institution :
Comput. Sci. Dept., Geneva Univ., Switzerland
fYear :
2001
fDate :
2001
Firstpage :
334
Lastpage :
337
Abstract :
Control-flow diagrams are often criticized as difficult to read because of numerous edge intersections. To improve the readability we propose a solution that manages the visual complexity of graphs with hundreds, or even thousands of nodes. It consists in applying heuristics to choose the best path for an edge and an appropriate color that will help distinguish an edge from its neighbors
Keywords :
data flow graphs; diagrams; visual languages; visual programming; control-flow diagrams; edge drawing; graph-based visual language; heuristics; readability; visual complexity; visual programming; Application software; Computer science; Courseware; Displays; Joining processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Human-Centric Computing Languages and Environments, 2001. Proceedings IEEE Symposia on
Conference_Location :
Stresa
Print_ISBN :
0-7803-7198-4
Type :
conf
DOI :
10.1109/HCC.2001.995284
Filename :
995284
Link To Document :
بازگشت