蝴蝶定理
Author: 9902高二忠班林俊穎

移動D,E觀察

蝴蝶定理

B = Intersect(c, a, 1.0)
A = Intersect(c, a, 2.0)
b_1 = Segment(B, A)
b = LineBisector(B, A)
O = Intersect(b, b_1)
D = Point(c)
E = Point(c)
d = Line(O, E)
e = Line(D, O)
E_1, F = Intersect(c, d)
G, C = Intersect(c, e)
f = Segment(D, C)
g = Segment(E, F)
h = Segment(D, F)
i = Segment(E, C)
Q = Intersect(h, b_1)
P = Intersect(i, b_1)
多邊形1, o, c_1, f_1 = Polygon(D, F, O)
多邊形2, h_1, d_1, o_1 = Polygon(E, O, C)
distanceIO = Distance(Q, O)
文字IO: "\overline{" + (Name[Q]) + (Name[O]) + "} \, = \, " + distanceIO
distanceJO = Distance(P, O)
文字JO: "\overline{" + (Name[P]) + (Name[O]) + "} \, = \, " + distanceJO
l_1 = Segment(P, O)
l_2 = Segment(Q, O)
文字2: "\overline{OP}=" + l_1
文字3: "\overline{ OQ }=" + l_2
n = 2 (slider from 0 to 2, step 1)