Dynamic Geometric Construction Demo
Loading the math board and drawing, please wait…
This example dynamically demonstrates a geometric problem involving geometric mean, unit circle, Pythagorean theorem, and function graphs. It visually showcases geometric relationships through operations like rotation, intersection, and dilation. The construction utilizes commands and objects such as Rotate, Ray, Line, Point, Intersect, Segment, Dilate, Angle, Circle, CircleSector, Vector, Translate, Polygon, Midpoint, CircleArc, Semicircle, OrthogonalLine, Distance. Suitable for high school mathematics education to understand the connection between complex geometric concepts and function graphs.
GeoGebra Commands & Parameters
Rotate(D, a°, A) → B'Ray(A, B') → gLine(D, g) → hPoint(g) → BRay(A, D) → fLine(B, f) → iIntersect(h, i) → CLine(A, C) → t_1Line(C, D) → i_3Segment(A, D) → b_2Point(b_2) → ELine(B, E) → j_3Intersect(j_3, t_1) → FDilate(F, If[7 < o ≤ 8, 8 - o, 0], E) → O'Segment(F, O') → r_1Intersect(i_3, j_3) → GSegment(E, G) → g_2Segment(B, C) → g_3Segment(A, B) → f_3Angle(D, A, B') → αSegment(B, C) → jSegment(A, D) → kSegment(D, C) → lSegment(A, B) → mMin(m, k) → bCircle(B, (0.2 * b)) → dCircle(A, (0.2 * b)) → eCircle(D, (0.2 * b)) → pCircle(C, (0.2 * b)) → cIntersect(e, k, 1) → E_1Intersect(e, m, 1) → F_1Intersect(p, k, 1) → G_1Intersect(p, l, 1) → HIntersect(d, g, 2) → IRay(B, I) → qIntersect(c, h, 2) → JRay(C, J) → rIntersect(c, i, 2) → KRay(C, K) → sDilate(A, If[0 < o ≤ 1, 1 - o, 0], D) → A'Segment(A, A') → tRotate(E_1, If[1 < o ≤ 2, ((o - 1) * α), α], A) → E'CircleSector(A, E_1, E') → c_1Dilate(A, If[2 < o ≤ 3, 3 - o, 0], B) → A'_1Vector(A, A'_1) → uTranslate(c_1, u) → d_1Segment(A, A'_1) → f_1Dilate(B, If[3 < o ≤ 4, 4 - o, 0], C) → C'Vector(B, C') → vTranslate(d_1, v) → e_1Segment(B, C') → g_1Dilate(C, If[4 < o ≤ 5, 5 - o, 0], D) → D'Segment(C, D') → h_1Polygon(A, D, C, B) → poly1, a_1, b_1, d_2, c_2Dilate(A, If[5.5 < o ≤ 6.5, 6.5 - o, 0], B) → A'_2Vector(A, A'_2) → wTranslate(A, w) → A'_3Translate(A', w) → A''Dilate(A, If[6.5 < o ≤ 7.5, 7.5 - o, 0], D) → A'_4Vector(A, A'_4) → u_1Translate(A, u_1) → A'_5Translate(A'_1, u_1) → LRotate(C, If[6 < o ≤ 7, ((-(o - 6)) * π / 3), ((-π)) / 3], D) → D'_2Rotate(D', If[6 < o ≤ 7, ((-(o - 6)) * π / 3), ((-π)) / 3], D) → D''Rotate(B, If[6 < o ≤ 7, ((-(o - 6)) * π / 3), ((-π)) / 3], C) → C'_2Rotate(C', If[6 < o ≤ 7, ((-(o - 6)) * π / 3), ((-π)) / 3], C) → C''Rotate(A, If[6 < o ≤ 7, ((-(o - 6)) * π / 3), ((-π)) / 3], B) → A'_7Rotate(A'_1, If[6 < o ≤ 7, ((-(o - 6)) * π / 3), ((-π)) / 3], B) → MRotate(A, If[6 < o ≤ 7, ((-(o - 6)) * π / 3), ((-π)) / 3], A) → A'_8Rotate(A', If[6 < o ≤ 7, ((-(o - 6)) * π / 3), ((-π)) / 3], A) → A''_1Rotate(C, If[7 < o ≤ 8, ((o - 7) * π / 3), π / 3], C) → D'_3Rotate(D', If[7 < o ≤ 8, ((o - 7) * π / 3), π / 3], C) → D''_1Rotate(B, If[7 < o ≤ 8, ((o - 7) * π / 3), π / 3], B) → C'_3Rotate(C', If[7 < o ≤ 8, ((o - 7) * π / 3), π / 3], B) → C''_1Rotate(A, If[7 < o ≤ 8, ((o - 7) * π / 3), π / 3], A) → A'_9Rotate(A'_1, If[7 < o ≤ 8, ((o - 7) * π / 3), π / 3], A) → NRotate(A, If[7 < o ≤ 8, ((o - 7) * π / 3), π / 3], D) → A'_{10}Rotate(A', If[7 < o ≤ 8, ((o - 7) * π / 3), π / 3], D) → A''_2Line(A, C) → s_2Midpoint(A, C) → QRotate(A, If[16 < o ≤ 17, ((o - 16) * π), π], Q) → A'_{11}Line(A, C) → h_3Dilate(A, If[5 < o ≤ 6, 6 - o, 0], C) → A'_6Segment(A, A'_6) → i_1Circle(G, r_1) → k_1Segment(F, E) → j_1Intersect(k_1, j_3, 2) → PCircle(P, 1) → p_1Intersect(p_1, j_3, 2) → RSegment(G, P) → l_1Ray(P, R) → m_1Intersect(k_1, i_3) → U, VRay(G, V) → n_1Dilate(B, If[6 < o ≤ 7, 7 - o, 0], F) → C'_1Segment(B, C'_1) → q_1Dilate(E, If[8 < o ≤ 9, 9 - o, 0], G) → S'Dilate(D, If[8 < o ≤ 9, 9 - o, 0], G) → B'_1Segment(D, B'_1) → s_1Segment(E, S') → f_2Rotate(E, If[10 < o ≤ 11, ((o - 10) * π), π], G) → S'_1Rotate(S', If[10 < o ≤ 11, ((o - 10) * π), π], G) → S''Rotate(P, If[11 < o ≤ 13, ((o - 11) * π / 2), π], Midpoint[F, P]) → P'Midpoint(F, P) → WCircleArc(W, P, P') → e_2Semicircle(F, P) → k_2OrthogonalLine(E, m_1) → i_2Distance(B, F) → distanceCOOrthogonalLine(G, m_1) → j_2Intersect(k_2, j_2) → A_1,Distance(A_1, G) → distanceA1TDistance(A_1, G) → distanceA1GDistance(B, F) → distanceBFRotate(F, If[10 < o ≤ 11, ((o - 10) * π), π], Midpoint[F, P]) → F'Rotate(O', If[10 < o ≤ 11, ((o - 10) * π), π], Midpoint[F, P]) → O''Segment(F', O'') → h_2Angle(A_1, G, F) → βDilate(G, If[13 < o ≤ 14, 14 - o, 0], A_1) → G'Segment(G, G') → l_2Angle(B, F, A) → γRotate(B, If[14 < o ≤ 15, ((o - 14) * γ / 2), γ / 2], F) → B'_2Rotate(C'_1, If[14 < o ≤ 15, ((o - 14) * γ / 2), γ / 2], F) → OSegment(B'_2, O) → m_2Dilate(F, If[15 < o ≤ 16, 16 - o, 0], G) → F'_1Vector(F, F'_1) → v_1Translate(B'_2, v_1) → STranslate(O, v_1) → O'_1Segment(S, O'_1) → n_2Rotate(S, If[16 < o ≤ 17, ((-(o - 16)) * (γ / 2 + π / 2)), (-(γ / 2 + π / 2))], G) → S'_2Rotate(O'_1, If[16 < o ≤ 17, ((-(o - 16)) * (γ / 2 + π / 2)), (-(γ / 2 + π / 2))], G) → TSegment(S'_2, T) → p_2