The Starburst algorithm quickly and clearly shows link relationships among the data
elements using a best-placement approach to expose clusters while minimizing line
crossings. It is designed to place closely related objects together and place
interconnected objects further from the cluster.
This Starburst example shows a set of very simple, discrete groupings.
The groups are placed from smallest to largest in the View.
This example shows a set of larger, more complex groupings. The largest group
is placed with the most closely related objects closest together and more distant relationships placed further away from the core grouping.
|
