Animation 91: Equilateral Triangles and Linear Programming
Loading the math board and drawing, please wait…
In collections
CCSS High School: Geometry (Congruence) Volume 2
CCSS High School: Geometry (Congruence) Volume 2
CCSS High School: Geometry (Congruence) Volume 2
CCSS High School: Geometry (Congruence) Volume 2
Geometry Review
This example demonstrates the dynamic integration of equilateral triangle rotation with linear programming problems. It involves core mathematical concepts such as equilateral triangle construction, linear programming, rotation, dilation, intersection calculation, and more. GeoGebra commands and objects like Segment, Point, Rotate, Min, Polygon, Dilate, Circle, Intersect, CircleSector, Vector, Translate, Line, Ray, Sort, and Angle are used in the construction. Suitable for high school and above mathematics learning, providing an intuitive understanding of geometric transformations and optimization problems.
GeoGebra Commands & Parameters
Segment(A, B) → lPoint(l) → LSegment(L, B) → f_1Segment(A, L) → nRotate(B, π / 3, A) → B'_2Segment(B'_2, L) → mMin(list1) → oPolygon(A, B, 3) → poly1, a, b, c, CDilate(A, If[0 < d ≤ 1, 1 - d, 0], B) → A'Segment(A, A') → eDilate(B, If[1 < d ≤ 2, 2 - d, 0], C) → B'Segment(B, B') → fDilate(C, If[2 < d ≤ 3, 3 - d, 0], A) → C'Segment(C, C') → gSegment(A, B) → hSegment(A, C) → iCircle(A, (0.35 * o)) → kSegment(B, C) → jIntersect(k, i, 1) → DIntersect(k, h, 1) → ECircleSector(A, E, D) → pRotate(A, If[3.5 < d ≤ 4.5, ((d - 3.5) * π / 3), 1.0471975511965976], A) → A'_1Rotate(A', If[3.5 < d ≤ 4.5, ((d - 3.5) * π / 3), 1.0471975511965976], A) → A''Segment(A'_1, A'') → e'Rotate(A, If[4.5 < d ≤ 5.5, ((-(d - 4.5)) * π / 3), -1.0471975511965976], B) → A'_2Rotate(A', If[4.5 < d ≤ 5.5, ((-(d - 4.5)) * π / 3), -1.0471975511965976], B) → A''_1Segment(A'_2, A''_1) → e'_1Dilate(A, If[6 < d ≤ 7, 7 - d, 0], B) → A'_3Vector(A, A'_3) → uTranslate(p, u) → p'Rotate(p', If[7 < d ≤ 8, (((d - 7) * 2) * π / 3), 2.0943951023931953], B) → p''Circle(B, (0.15 * h)) → rIntersect(f, e'_1) → GIntersect(f, e'_1) → HIntersect(f, e'_1) → IIntersect(f, e'_1) → JIntersect(r, j, 1) → FIntersect(r, h, 1) → KDilate(B, If[8 < d ≤ 9, 9 - d, 0], C) → B'_1Vector(B, B'_1) → vTranslate(p'', v) → p'''Rotate(p''', If[9 < d ≤ 10, (((d - 9) * 2) * π / 3), 2.0943951023931953], C) → tLine(A, B) → g_1Point(g_1) → MRay(B, M) → h_1Point(h_1) → NRay(B, N) → i_1Sort(list1) → list2Circle(N, Element[list2, 2]) → c_1Circle(N, Element[list2, 1]) → d_1Dilate(B'_2, If[10 < d ≤ 11, 11 - d, 0], L) → QSegment(B'_2, Q) → n_1Segment(A, L) → p_1Segment(L, B) → q_1Circle(N, Element[list2, 3]) → e_1Intersect(e_1, i_1, 1) → OCircle(N, p_1) → k_1Circle(O, q_1) → r_1Intersect(k_1, r_1, 1) → PSegment(N, P) → j_1Segment(P, O) → l_1Segment(O, N) → m_1Rotate(N, π / 3, P) → N'Angle(N, P, N') → αRay(P, N') → sDilate(L, If[11.5 < d ≤ 12.5, 12.5 - d, 0], N) → L'Vector(L, L') → wTranslate(B'_2, w) → RTranslate(Q, w) → Q'Segment(R, Q') → s_1Angle(B, L, B'_2) → βRotate(R, If[11 < d ≤ 12, ((-(d - 11)) * β), (-β)], Q') → R'Rotate(Q', If[11 < d ≤ 12, ((-(d - 11)) * β), (-β)], Q') → Q''Rotate(R, If[11.5 < d ≤ 12.5, ((-(d - 11.5)) * β), (-β)], L') → R'_1Rotate(Q', If[11.5 < d ≤ 12.5, ((-(d - 11.5)) * β), (-β)], L') → Q''_1Segment(R'_1, Q''_1) → t_1Dilate(L, If[12.5 < d ≤ 13.5, 13.5 - d, 0], P) → L'_1Vector(L, L'_1) → u_1Translate(A, u_1) → A'_4Translate(L, u_1) → L'_2Segment(A'_4, L'_2) → a_1Line(P, N) → b_1Line(L, b_1) → f_2Point(f_2) → SAngle(A, L, S) → γRotate(A'_4, If[12.5 < d ≤ 13.5, ((d - 12.5) * γ), γ], L'_2) → TRotate(L'_2, If[12.5 < d ≤ 13.5, ((d - 12.5) * γ), γ], L'_2) → USegment(T, U) → g_2Dilate(B, If[13.5 < d ≤ 14.5, 14.5 - d, 0], P) → B'_3Vector(B, B'_3) → v_1Translate(L, v_1) → L'_3Translate(B, v_1) → B'_4Segment(L'_3, B'_4) → h_2Line(P, O) → i_2Line(B, i_2) → j_2Point(j_2) → VAngle(V, B, A) → δRotate(L'_3, If[13.5 < d ≤ 14.5, ((-(d - 13.5)) * δ), (-δ)], B'_4) → WRotate(B'_4, If[13.5 < d ≤ 14.5, ((-(d - 13.5)) * δ), (-δ)], B'_4) → ZSegment(W, Z) → k_2Polygon(N, O, P) → poly2, p_2, n_2, o_1Dilate(B, If[15 < d ≤ 16, 16 - d, 0], P) → B'_5Vector(B, B'_5) → qTranslate(p'', q) → p'''_1Line(B, s) → l_2Point(l_2) → A_1Angle(A_1, B, L) → εRotate(p'''_1, If[16 < d ≤ 17, ((-(d - 16)) * ε), (-ε)], B'_5) → c_2Angle(N, P, N') → ζDilate(B, If[17 < d ≤ 18, 18 - d, 0], P) → B'_6Vector(B, B'_6) → w_1Translate(p'', w_1) → p'''_2Rotate(p'''_2, If[18 < d ≤ 19, ((-(d - 18)) * (ε - π / 3)), (-(ε - π / 3))], P) → d_2Angle(N', P, O) → ηDilate(A, If[10 < d ≤ 11, 11 - d, 0], L) → A'_5Segment(A, A'_5) → m_2Dilate(B, If[10 < d ≤ 11, 11 - d, 0], L) → B'_7Segment(B, B'_7) → q_2