Chisio : a visual framework for compound graph editing and layout
Item Usage Stats
MetadataShow full item record
Graphs are data models, widely used in many areas from networking to biology to computer science. Visualization, interactive editing ability and layout of graphs are critical issues when analyzing the underlying relational information. There are many commercial and non-commercial graph visualization tools. However, overall support for compound or hierarchically organized graph representations is very limited. We introduce a new open-source editing and layout framework named Chisio for compound graphs. Chisio is developed as a free, easy-to-use and powerful academic graph visualization tool, supporting various automatic layout algorithms. It is written in Java and based on Eclipse’s Graphical Editing Framework (GEF). Chisio can be used as a finished generic compound graph editor with standard graph editing facilities such as zoom, scroll, add or remove graph objects, move, and resize. Object property and layout options dialogs are provided to modify existing graph object properties and layout options, respectively. In addition, printing or saving the current drawing as a static image and persistent storage facilities are supported. Saved graphs or GraphML formatted files created by other tools can be loaded into Chisio. Furthermore, a highlight mechanism is provided to emphasize subgraphs of users interest. The framework has an architecture suitable for easy customization of the tool for end-users’ specific needs as well. Also Chisio offers several layout styles from the basic spring embedder to hierarchical layout to compound spring embedder to circular layout. Furthermore, new algorithms are straightforward to add, making Chisio an ideal test environment for layout algorithm developers.
T385 .K83 2007
Showing items related by title, author, creator and subject.
Akbudak K.; Aykanat, C. (IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ...
Dogrusoz, U.; Belviranli, M. E.; Dilek, A. (Institute of Electrical and Electronics Engineers, 2013)We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring ...
Eser, E.; Kocayusufoglu, F.; Eravci, B.; Ferhatosmanoglu, H.; Larriba-Pey, J. L. (IEEE Computer Society, 2017)While research on time-varying graphs has attracted recent attention, the research community has limited or no access to real datasets to develop effective algorithms and systems. Using noisy and sparse GPS traces from ...