A set consists in a finite ordered list of points. Thus a set can also be seen as an open path of line segments or as a polygon.
A set of two points is considered as a single line segment. When a parameter is expected to be a segment, any subsequent point is ignored.
s.t
s[i]
set(P)
card(s)
length(s)
perimeter(s)
area(s)
arg(s)
point(s, x)
midpoint(s)
bisector(s)
isobarycenter(s)
centroid(s)
element(s, i)
vector(s)
sub(s, i, j)
polygon(n, O, r, a)
pentagon(O, r, a)
hexagon(O, r, a)
empty
Each element of a variable containing a set may be modified individually using its index enclosed in square brackets.
Example: S[1] = point(2, pi/3)
When using empty square brackets, the given point is added to the tail of the set.
Example: S[] = point(0, 0)
Several elements of a set may be assigned at once to a dot separated list of variables. Exceeding points, if any, are ignored.
Example: A.B.C.D.E = pentagon(O, 1, 0°)