| Orthogonal Layout | ||
|---|---|---|
| Prev | Chapter 5. Automatic Graph Layout | Next |
Class OrthogonalLayouter
is
a multi-purpose layout provider for undirected graphs.
It produces clear representations of complex networks and is especially fit for
application areas such as
The orthogonal layout algorithm is based on the topology-shape-metrics approach and consists of three phases. In the first phase the edge crossings in the drawing are calculated. The second phase computes the bends in the drawing, in the third phase the final coordinates are determined.
The layout algorithm is well suited for medium-sized sparse graphs. It produces compact drawings with no overlaps, few crossings, and few bends.
Figure 5.55. Sample layouts produced by class OrthogonalLayouter
 |
 |
| UML class diagram representing a part of the layout interface of yFiles. | This diagram shows finite state automaton from an industrial application. |
Class OrthogonalLayouter knows a number of data provider keys which are used to retrieve supplemental layout data for a graph's elements. The data is bound to the graph by means of a data provider, which is registered using a given look-up key. Table 5.34, “Data provider look-up keys” lists all look-up keys for OrthogonalLayouter.
Binding supplemental layout data to a graph is described in the section called “Providing Supplemental Layout Data”.
Table 5.34. Data provider look-up keys
| Key | Element Type | Value Type | Description |
|---|---|---|---|
| EDGE_LABEL_LAYOUT_KEY |
Edge | LabelLayoutData[] | For each edge an array of LabelLayoutData objects that encode size and preferred placement for all labels of the edge. |
Defines the virtual grid spacing used by the layout algorithm. Each node will be placed in such a way that its center point lies on a grid point. Edges will be routed in such a way that their segments lie on grid lines, if the terminal nodes of the edges allow to place the ports accordingly. Note that this option is only guaranteed to be obeyed for "Normal Layout Style," for all other styles it is used as a hint only.
If enabled, the overall edge lengths will be reduced. The cost for the reduction is an increased execution time of the layout algorithm.
If enabled, avoids helical arrangement of chains of nodes.
If enabled, the layout algorithm will interpret the initial graph layout as a sketch of the resulting orthogonal layout. The layout algorithm tries to "orthogonalize" the given sketch without making too much modifications in respect to the original drawing.
If enabled, the overall number of edge crossings will be reduced. The cost for the reduction is increased execution time of the layouter.
If enabled, the overall layout quality will increase with high probability. The cost for this layout optimization is increased execution time and non-deterministic results for subsequent layout invocations.
See the section called “Orthogonal Layout of Hierarchically Grouped Graphs” on how to calculate an orthogonal style layout of a grouped graph.
Besides the generic labeling support as described in the section called “Generic Labeling”, which is available with all yFiles layout algorithms, the orthogonal layout algorithm additionally supports integrated labeling. Furthermore, it can also be set up to take node labels into account during layout.
Integrated labeling is available for edge labels and can be used in conjunction with layout style "Normal." They are taken into consideration when determining both node placement and edge path generation. With this strategy it is guaranteed that no edge label will overlap other objects in the diagram.
Integrated labeling can be enabled or disabled using the following setter method:
boolean isIntegratedEdgeLabelingEnabled() |
|
| Description | Determines whether integrated labeling is enabled. |
See also the section called “Integrated Labeling”.
Optimal label placement with integrated labeling can be achieved using FreeEdgeLabelModel
as the label model for the edges.
As explained in the section called “Label Models”, this edge label model is ideally
suited in combination with integrated labeling and yields the best match for a label
location that is computed by OrthogonalLayouter.
OrthogonalLayouter provides support for node label-aware orthogonal layout. Node labels do not need to be placed, but instead their size needs to be considered for the placement of adjacent graph elements. Taking node labels into consideration during layout calculation guarantees that they will not overlap nodes in the diagram.
| Consider Node Labels | |
| API | void setConsiderNodeLabelsEnabled(boolean enabled) |
| Description | Enables node label-aware layout calculation. |
Layout module OrthogonalLayoutModule.java presents the setup of class OrthogonalLayouter in an application context.
The running time of orthogonal layout can be reduced by disabling some of the optimization settings.
For example, turning off the "Crossing Postprocessing" option can have a substantial effect on the run-time, especially when the graph has many edge crossings. Disabling further settings, like, e.g., "Optimize Perceived Bends," or "Length Reduction" also reduces execution time.
|
Copyright ©2004-2010, yWorks GmbH. All rights reserved. |
