org.graphstream.ui.j2dviewer.renderer
The i-th point of the edge shape.
Compute the bounding box of the given set of points.
Compute the bounding box of the given set of points.
A 2-tuple with the minimum and maximum 3D points.
The first point of the edge shape.
Try to extract an array of double values from various sources.
Try to extract an array of double values from various sources.
Try to extract an array of 3D points from various sources.
Try to extract an array of 3D points from various sources. It actually works only for arrays of Point3, or arrays of floats, doubles and integers.
An array of 3D points.
The contents of the element.
The contents of the element. Allows to extract metrics of the contents.
If true the edge shape is a loop defined by four points.
This is only set when the edge is a curve, if true the starting and ending nodes of the edge are the same node.
If true the edge shape is a polyline made of size points.
Total length of the polyline defined by the points.
If larger than one there are several edges between the two nodes of this edge.
Compute a point at a given percent on the shape and store it in the target, also returning it.
Compute a point at a given percent on the shape and store it in the target, also returning it. The percent must be a number between 0 and 1.
Compute a point at the given percent on the shape and return it.
Compute a point at the given percent on the shape and return it. The percent must be a number between 0 and 1.
Compute a point at a given percent on the shape and push it from the shape perpendicular to it at a given distance in GU.
Compute a point at a given percent on the shape and push it from the shape perpendicular to it at a given distance in GU. The percent must be a number between 0 and 1. The result is stored in target and also returned.
Compute a point at a given percent on the shape and push it from the shape perpendicular to it at a given distance in GU.
Compute a point at a given percent on the shape and push it from the shape perpendicular to it at a given distance in GU. The percent must be a number between 0 and 1. The resulting points is returned.
Length of the i-th segment.
Length of the i-th segment. There are size-1 segments if there are size points. The segment 0 is between points 0 and 1.
Compute the length of each segment between the points making up this edge.
Compute the length of each segment between the points making up this edge. This is mostly only useful for polylines. The results of this method is cached. It is only recomputed when a points changes in the shape. There are size-1 segments if the are size points. The segment 0 is between points 0 and 1.
The number of points in the edge shape.
The last point of the edge shape.
Change the i-th point in the set of points making up the shape of this edge.
On which segment of the line shape is the value at.
On which segment of the line shape is the value at. The value at must be between 0 and 1 and expresses a percentage on the shape. There are size-1 segments if size is the number of points of the shape. The segment 0 is between points 0 and 1. This method both compute the index of the segment, but also the sum of the previous segments lengths (not including the i-th segment), as well as the percent on the segment (a number in 0..1).
Skeleton for edges. Data stored on the edge to retrieve the edge basic geometry and various shared data between parts of the renderer.
XXX TODO This part needs much work. The skeleton geometry of an edge can be various things: