三角測量 (19)
Author: 藍邦偉 老師

三角測量(19)

B = (11.68, -2.54)
f: y = y(B)
A = (8.42, 1.18)
a = Ray(A, B)
C = Point(f)
b = Ray(A, C)
c: x = x(B)
d: x = x(C)
D = Point(d)
e: y = y(D)
E = Intersect(c, e)
F = Point(b)
g: y = y(F)
G = Intersect(g, a)
h = Ray(A, D)
i = Ray(A, E)
j = Line(F, d)
k = Line(G, c)
H_1 = Intersect(j, h)
I = Intersect(k, i)
t = 0.02 (slider from 0 to 1, step 0.01)
Q_1: C + t * Vector[C, F]
Q_2: B + t * Vector[B, G]
Q_3: E + t * Vector[E, I]
Q_4: D + t * Vector[D, H_1]
p = Circle(A, C)
J = (11.46, -3.02)
L = (-1.2, -2.32)
M = (8.84, 1)
N = (8, 1.04)
K = Corner(1.0)
多邊形1, k_1, l, n, m, j_1 = Polygon(K, L, N, M, J)
O_1 = (13.58, -2.02)
O_2 = (11.82, -0.8200000000000001)
O_3 = (11.28, -0.48)
O_4 = (10.74, -0.06)
O_5 = (10.46, 0.1)
O_6 = (10.22, 0.26)
O_7 = (9.9, 0.44)
O_8 = (9.74, 0.58)
q: y = y(O_1)
r: y = y(O_2)
s: y = y(O_3)
a_1: y = y(O_4)
b_1: y = y(O_5)
c_1: y = y(O_6)
d_1: y = y(O_7)
e_1: y = y(O_8)
M_1 = Midpoint(Intersect[q, l], Intersect[q, m])
M_2 = Midpoint(Intersect[r, l], Intersect[r, m])
M_3 = Midpoint(Intersect[s, l], Intersect[s, m])
M_4 = Midpoint(Intersect[a_1, l], Intersect[a_1, m])
f_1 = Segment(M_1, M_2)
g_1 = Segment(M_3, M_4)
M_5 = Midpoint(Intersect[b_1, l], Intersect[b_1, m])
M_6 = Midpoint(Intersect[c_1, l], Intersect[c_1, m])
M_7 = Midpoint(Intersect[d_1, l], Intersect[d_1, m])
h_1 = Segment(M_5, M_6)
M_8 = Midpoint(Intersect[e_1, l], Intersect[e_1, m])
i_1 = Segment(M_7, M_8)
Q_M: 0.5 * (Q_1 + Q_3)
H = (1.1, 4.22)
l_1: x = x(H)
O = Point(l_1)
m_1 = Segment(O, H)
n_1 = Segment(H, Q_M)
p_1 = Segment(Q_M, O)
α = Angle(O, Q_M, H)