x_0

x_{-1}

x_1

f(x_{-1},y_{-1})

m_0=f(x_{0},y_{0})

f(x_{1},y_{1})

y_1-y_{-1}

h

h

m_{-1}

m_{-1}

I = (3, 0)
D: (3, 3.6)
l = Segment(I, D)
f = OrthogonalLine(D, l)
C: (2, 2)
g = OrthogonalLine(C, xAxis)
E: (4, 4.6)
H = Point(xAxis)
k = Segment(H, C)
J = Point(xAxis)
m = Segment(J, E)
B = Intersect(f, m)
A = Intersect(f, g)
v1, a, h, j, b = Polygon(A, H, J, B)
F = Point(g)
i = Segment(F, H)
n = OrthogonalLine(E, i)
q(x) = If[x(C) < x < x(E), Polynomial[{C, D, E}]]
p = Segment(C, H)