SEARCH RESULTS
Graph Theory Objects
A powerful array of graph theory objects was introduced with the release of Eye-Sys® v2.0 in September 2008. With these tools at your disposal, you can analyze large, complex networks – of people, facilities, computer systems, events etc. – to quickly identify associations and patterns.
Compute shortest path, connectivity, neighbors, Boolean operations and so on, at speeds an order of magnitude faster than with any other graph renderer.
Organize graphs in a variety of hierarchical views, or map them to a flat or global projection. And Eye-Sys v2.0 permits import of a number of graph formats, including UCINET DL, Tom Sawyer®, and GML.
World-class graph rendering is what you’ll start with, but the graphs and the data feeding them can interoperate with the other objects in Eye-Sys, allowing users to manipulate the data interactively, decorate the graph with plots & gadgets, and mix the graph objects with other 3D objects, all simultaneously.
Of course, all graphing features are included in the evaluation version of Eye-Sys, available here.
Graphing Highlights
Render Speed
IDV, a leader in real-time entertainment software, has applied its expertise in render speed and efficiency throughout the Eye-Sys graphing toolset; graphs render far faster, by at least an order of magnitude, than other graph rendering tools.
Ease of Modifications
Many aspects of your graph - size, lines, label colors etc. - can be programmed and quickly changed in the databases that determine graph object attributes.
Layout Algorithms
Eye-Sys v2.0 offers a variety of layout options, described below.
- Simple
- Hierarchical
- Force-Directed
- Principal component
click on an algorithm category above for more information.
Simple
These layout algorithms are simple and fast to perform. This category Includes:
- Random
- Square
- Single ring
- 3D random
- Cube
- Sphere
Hierarchical
These layout algorithms treat the graph as a tree and do the layout accordingly. This category Includes:
- Tree
- Radial
- Floored radial
- Spring radial
- Stars
- Compact stars
Force-directed
Conceptually simple, this layout algorithm treats all edges as springs and all vertices as point charges. This system is then allowed to move until a low energy state is achieved. Force-directed layouts are iteravely solved, so they can be quite slow. This category Includes:
- Force-Directed 2D
- Force-Directed 3D
Principal component
Principal component analysis is performed on the graph structure in up to 50 dimensions, based on "pivot" vertices chosen so that the graph is partitioned into equally sized pieces. This algorithm clusters vertices by their connections. Principal component layout is much faster than force-directed methods, but does not work well on tree-like graphs. This category Includes:
- 2D fast (renders quickly)
- 2D accurate (slower but more accurate)
- 3D fast (renders in 3D quickly)
- 3D accurate (renders in 3D more slowly but more accurately)
All graphing features are included in the evaluation version of Eye-Sys, available here.
