Package ilog.views.graphlayout.labellayout.annealing

The Annealing Label Layout places labels close to related obstacles such that the amount of overlaps among labels, and between labels and obstacles is small.

See: Description

Interface Summary

Interface	Description
IlvAnnealingLabelDescriptorProvider	This interface is useful if your application knows which labels belong to which related obstacle even when there are no label descriptors.
IlvObstacleOffsetInterface	An interface used to select specific minimal offsets between certain label/obstacle pairs.

Class Summary

Class	Description
IlvAnnealingLabelDescriptor	The class IlvAnnealingLabelDescriptor is the abstract base class of all label descriptors.
IlvAnnealingLabelLayout	The main class for the Simulated Annealing Label Layout algorithm.
IlvAnnealingLabelLayoutLabelProperty	The class IlvAnnealingLabelLayoutLabelProperty allows you to store the settings of an instance of IlvAnnealingLabelLayout for an individual label as a named property in the label.
IlvAnnealingLabelLayoutManagerProperty	The class IlvAnnealingLabelLayoutManagerProperty allows you to store the global settings of an instance of IlvAnnealingLabelLayout as a named property in the manager.
IlvAnnealingPointLabelDescriptor	The class IlvAnnealingPointLabelDescriptor can be used to specify that the label should be placed close to specific point (the point labeling problem).
IlvAnnealingPolylineLabelDescriptor	The class IlvAnnealingPolylineLabelDescriptor can be used to specify that the label should be placed close to a polyline (the polyline labeling problem).
IlvOverlappingLabelMovementPolicy	A label movement policy that allows a label to be moved by the label layout algorithm only if the label initially overlaps other labels or obstacles.

Package ilog.views.graphlayout.labellayout.annealing Description

The Annealing Label Layout places labels close to related obstacles such that the amount of overlaps among labels, and between labels and obstacles is small. Simulated annealing is a quality controlled, randomized iterative heuristic. The labels are placed according to a temperature scheme, and the quality of the placement increases when the temperature decreases. The quality is defined by the amount of overlaps between pairs of labels and between labels and obstacles. The fewer overlaps the higher the quality. Simulated annealing, as randomized algorithm, does not guarantee a placement of the labels without overlaps. However, it produces a quality layout with a high probability. The more iterations the higher the probability of high quality.

Sample drawing produced with the Annealing Label Layout:

Left: labeling of nodes in a graph, Right: labeling of cities

Click on the image to see it in normal size.

Link labeling

Click on the image to see it in normal size.

Since:

JViews 5.0

See Also:

ilog.views.graphlayout.labellayout