|
As a branch of Graph theory, Graph drawing applies topology and geometry to derive visual and haptic representations of graphs. It identifies classes of graphical record, such that for both class there is an effective procedure for embedding any of its members into some metric space. It so sets intent on formally specify, implement, and verify such procedures.
Graphical record drawing is motivated by applications that postulate visual image, navigation, fabrication, or even even beauty of its physical or conceptual artefact that stand been embedded into a graphical record's structure. These are the key ingredient around technologies equally varied when VLSI circuit design, social networks, user interface design, software engineering, computer networks, e-commerce, cartography, and bioinformatics.
Graphical record come normally represented pictorially applying dots to represent vertexes, & arcs to represent a edges between connected vertexes. Arrows can be utilized to show a orientation of directed edges. Note that this in writing representation (the graphical record layout or an embedding) should does'nt exist as confused by having a graphical record itself (a abstract, non-graphical structure). Super different layouts could correspond to the equivalent graphical record (look at external hyperlink #1). In the abstract, tons that matters is which vertices come attached to which others by how else numerous edges. In a concrete, even so, the arrangement one vertexes & edges impacts comprehensibility, serviceableness, fabrication dollars & cents, and esthetic.
According to these construct & caveats, there got emerged different graphical record layouts. On text come a bit of of the better known ones:
force-based layout - by using an energy function that is minimized so that nodes & edges spread retired by attraction & repulsion.
orthogonal layout - layout using edges running off horizontally or even vertically, using approaches that reduce a total of edge crossovers & locality covered. Which are actually of swell interest in the areas of VLSI and PCB layout design.
symmetrical layout - these attempt to call for symmetry groups within the graph
tree layout - these indicate the rooted tree-like formation, suitable for trees (ie graphs without rounds)
hierarchic layouts - these attempt to buy a source & sink around a directed graphical record & arrange the nodes in shells sustaining virtually all edges starting from either the source & flow in the counsel of the sink.
Academic conferences
One of a top academic conferences for fresh the food and drug administratiin within graphical record drawing is the annually held International Symposium on Graph Drawing (GD).
[http://www.gd2005.org/ GD 2005 (Limerick, Ireland)]
Open problems
Recently, the wiki for keeping track of the open problems in the field of graphical record drawing has been install.
http://problems.graphdrawing.org
|
GDToolkit - a Graph Drawing Toolkit
GDToolkit (also known as GDT) is a Graph Drawing Toolkit designed to efficiently manipulate several types of graph, and to automatically draw them according to many different aesthetic criteria and constraints.
graphdrawing.org
Information source for researchers, practitioners, developers, and users working on all aspects of graph visualization and representation.
Tom Sawyer Software
Graph analysis and visualization component software for ActiveX, C++, Java, JSP, MFC and .NET. Free trial download.
Pajek - a Package for Large Network Analysis
This program runs under Windows NT/9x and provides some analysis tools for large networks and graph-drawing capabilities.
Graphlet
A toolkit for graph editors and graph algorithms. Unix and Win32 binaries for free download.
aiSee Graph Layout Software
aiSee automatically calculates a customizable layout of graphs specified in GDL (graph description language). aiSee supports 15 basic graph layout algorithms, recursive subgraph nesting, fish-eye views and easy printing. It has been optimized to handle large graphs automatically generated by applications (e.g. compilers).
Tulip
System dedicated to the visualization of huge graphs. It manages graphs with a number of elements (nodes and edges) up to 500,000 on a personal computer. It features 3D visualization and modification. GPL.
PIGALE - Public Implementation of a Graph Algorithm Library and Editor
PIGALE is a graph editor and an algorithm library essentially concerned with planar graphs. Written in C++ and interfaced with the Qt library, it is particularly intended for graph theoretical research. PIGALE is released under GPL.
yFiles - the Java Graph Drawing Library
yFiles is an extensive Java class library that provides algorithms and components for analyzing, viewing and layouting graphs, diagrams and networks.
AGD - Algorithms for Graph Drawing
AGD offers a broad range of existing algorithms for two-dimensional graph drawing and tools for implementing new algorithms. It is a product of a cooperation of groups in Halle, Köln, and Saarbrücken supported by the DFG in the program "Design, Analysis, Implementation, and Evaluation of Graph Drawing Algorithms".
|