Abstract
We present the Higres system - a visualization tool, an editor for clustered graphs and a platform for execution and animation of graph algorithms. Higres can handle any attributed graphs and perform animated semantic processing of them. The semantics of a graph can be defined by the user in the graph editor. The user can also create new external modules to process graphs with defined semantics. In addition we provide a possibility to extend system with new graph drawing algorithms by using special type of external modules for this purpose. We provide an easy to use C++ library for implementation of both types of extensions.
Supported by RFBR Grant N 98-01-748
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. Sander. Graph layout through the VCG tool. Proc. of Graph Drawing’ 94, volume 894 of LNCS, pages 194–205, 1995.
M. Fröhlich and M. Werner. Demonstration of the interactive graph visualization system daVinci. Proc. of Graph Drawing’ 94, volume 894 of LNCS, pages 266–269, 1995.
M. Himsolt. The Graphlet System (system demonstration). Proc. of Graph Drawing’ 96, volume 1190 of LNCS, pages 233–240, 1997.
H. Lauer, M. Ettrich and K. Soukup. GraVis-System Demonstration. Proc. of Graph Drawing’ 97, volume 1353 of LNCS, pages 344–349, 1997.
B. Madden, P. Madden, S. Powers and M. Himsolt. Portable Graph Layout and Editing. Proc. of Graph Drawing’ 95, volume 1027 of LNCS, pages 385–395, 1996.
K. Mehlhorn and S. Näher. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38:96–102, 1995.
K. Siguyama and K. Misue. A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR. Proc. of Graph Drawing 95, volume 1027 of LNCS, pages 500–503, 1996.
P. Eades, Q.W. Feng. Drawing Clustered Graphs on an Orthogonal Grid. Proc. of Graph Drawing 97, volume 1353 of LNCS, pages 182–193, 1997.
P. Eades, Q.W. Feng. Multilevel visualization of Clustered Graphs. Proc. of Graph Drawing 96, volume 1190 of LNCS, pages 101–112, 1997.
P. Eades, Q.W. Feng and X. Lin. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Proc. of Graph Drawing 96, volume 1190 of LNCS, pages 113–128, 1997.
Q. W. Feng, R. Cohen and P. Eades. How to draw a planar clustered graph. In COCOON’95, volume 959 of LNCS, pages 21–31, 1995.
P. Eades. A Heuristic For Graph Drawing. Congressus Numerantium, 42, pages 149–160, 1984.
M. L. Huang, P. Eades. A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. Proc. of Graph Drawing 98, volume 1547 of LNCS, pages 374–383, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lisitsyn, I.A., Kasyanov, V.N. (1999). Higres — Visualization System for Clustered Graphs and Graph Algorithms. In: Kratochvíyl, J. (eds) Graph Drawing. GD 1999. Lecture Notes in Computer Science, vol 1731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46648-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-46648-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66904-3
Online ISBN: 978-3-540-46648-2
eBook Packages: Springer Book Archive