Optimisation de l'aire d'un carré et d'un triangle
Author: Patrice Debart

B = (8, 0)
A = (0, 0)
C = Rotate(A, 270.0°, B)
D = Rotate(B, 90.0°, A)
AB = Segment(A, B)
CD = Segment(C, D)
M = Point(AB)
BC = Segment(B, C)
Q = Rotate(A, 270.0°, M)
P = Rotate(M, 90.0°, A)
d = LineBisector(M, B)
dPQ = Line(P, Q)
N = Intersect(d, dPQ)
MQ = Segment(M, Q)
PQ = Segment(Q, P)
MN = Segment(M, N)
NB = Segment(N, B)
a = Segment(A, M)
MB = Segment(M, B)
I = Point(xAxis)
J = Point(xAxis)
K = (10, 8)
dIJ = Ray(I, J)
dIK = Ray(I, K)
AP = Segment(A, P)
s = Area(A, M, Q, P)
DP = Segment(D, P)
S: (a + 10.0, s)
t = Area(M, N, B)
T: (a + 10.0, t)
R: (a + 10.0, 0.0)
RS = Segment(R, S)
ST = Segment(S, T)
lieu1 = Locus(S, M)
lieu2 = Locus(T, M)