#56 Distorted Star of David with Parallelograms
Loading the math board and drawing, please wait…
① This example demonstrates a distorted Star of David composed of multiple parallelograms, showcasing a geometric construction with symmetry and transformations. ② Core mathematical concepts include polygons, parallelograms, central symmetry, reflection, translation, and point construction, involving triangles, quadrilaterals, and logical relationships. ③ Construction highlights: using GeoGebra commands such as Segment, Polygon, Centroid, Mirror, Intersect, PointIn, Line, Translate, and PointList, it constructs various points (e.g., C, B, A, D, M, N) and objects (poly1, poly3, POLY1), applying mirror, translation, and centroid operations to generate symmetric parallelogram arrangements that form the distorted star. ④ Suitable for middle/high school geometry lessons or math enrichment, helping students understand symmetry transformations, polygon combinations, and dynamic geometric construction, as well as exploring parallelogram properties and star-pattern generation logic.
GeoGebra Commands & Parameters
Segment(A, C) → dPolygon(A, B, C) → poly1, c, a, bCentroid(poly1) → DMirror(C, D) → C'Mirror(B, D) → B'Segment(C', B') → mIntersect(m, d) → MMirror(A, D) → A'Segment(A', B') → lIntersect(l, d) → NSegment(A, A + (t1 * (C - A))) → fSegment(B', B' + (t3 * (A' - B'))) → iIntersect(f, i) → FSegment(C', C' + (t3 * (B' - C'))) → jIntersect(f, j) → ESegment(B, B + (t1 * (A - B))) → hIntersect(h, j) → JPointIn(Polygon[B', M, N]) → GLine(G, i) → qIntersect(q, j) → ISegment(C, C + (t1 * (B - C))) → gLine(G, j) → pIntersect(p, i) → HPolygon(B', I, G, H) → poly3, b', i_1, g_1, h_1Translate(B', Vector[B', B' + (t6 * (J - B'))]) → B''Translate(G, Vector[B', B' + (t6 * (J - B'))]) → G'Translate(H, Vector[B', B' + (t6 * (J - B'))]) → H'Translate(I, Vector[B', B' + (t6 * (J - B'))]) → I'Polygon(B'', I', G', H') → poly3', b'', i', g', h'Intersect(g, i) → KTranslate(B', Vector[B', B' + (t6 * (K - B'))]) → B''_1Translate(I, Vector[B', B' + (t6 * (K - B'))]) → I'_1Translate(G, Vector[B', B' + (t6 * (K - B'))]) → G'_1Translate(H, Vector[B', B' + (t6 * (K - B'))]) → H'_1Polygon(B''_1, I'_1, G'_1, H'_1) → poly3'_1, b''_1, i'_1, g'_1, h'_1Segment(C, C + (t7 * (G' - C))) → rSegment(B, B + (t7 * (G - B))) → sIntersect(r, s) → LSegment(A, A + (t7 * (G'_1 - A))) → tSegment(A', A' + (t3 * (C' - A'))) → kPointList({B', M, N}) → list1PointIn(Polygon[B', M, N]) → O