Author: Nicolas ERDRICH

SECTIONS D'UN PAVE DROIT

Créé par Nicolas ERDRICH sur GeoGebra

Arêtes cachées

w = 1 (slider from 1 to 5, step 0.1)
v = 1 (slider from 1 to 5, step 0.1)
u = 1 (slider from 1 to 5, step 0.1)
b = 2.5830872929516078 (slider from 0*° to 360*°, step 1*°)
sinγ: sin(b)
cosγ: cos(b)
R_z: {{cosγ, sinγ, 0}, {-sinγ, cosγ, 0}, {0, 0, 1}}
a = 62.2 (slider from 10 to 100, step 0.1)
echelle: {{a, 0, 0}, {0, a, 0}, {0, 0, a}}
P = (-230.5867202722093, 141.17146284204145)
β: x(P) * 5
sinβ: sin(β°)
cosβ: cos(β°)
R_y: {{cosβ, 0, -sinβ}, {0, 1, 0}, {sinβ, 0, cosβ}}
α: y(P) * 5
sinα: sin(α°)
cosα: cos(α°)
R_x: {{1, 0, 0}, {0, cosα, sinα}, {0, -sinα, cosα}}
I = (-94.19248089899924, 107.45998561874835)
cube: {{{u}, {v}, {w}}, {{-u}, {v}, {w}}, {{-u}, {-v}, {w}}, {{u}, {-v}, {w}}, {{u}, {v}, {-w}}, {{-u}, {v}, {-w}}, {{-u}, {-v}, {-w}}, {{u}, {-v}, {-w}}}
Mat: echelle * R_x * R_y * R_z
cube' = Sequence(Mat * Element[cube, k], k, 1, 8)
X: {1, 0, 0}
Y: {0, 1, 0}
Z: {0, 0, 1}
AE: Element[cube', 5] - Element[cube', 1]
droite = Element(Element[AE, 3], 1)
listepoints = Sequence(I + (Element[cube', k, 1, 1], Element[cube', k, 2, 1]), k, 1, 8)
C = Point(listepoints)
AB: Element[cube', 2] - Element[cube', 1]
avant = Element(AB, 3, 1)
AC: Element[cube', 4] - Element[cube', 1]
dessus = Element(AC, 3, 1)
o = true
J = Point(listepoints)
K = Point(listepoints)
L = Point(listepoints)
poly7, j_2, k_1, l_1, c_5 = Polygon(J, K, L, C)
M = Point(listepoints)
N = Point(listepoints)
poly8, j_3, m_1, n_1, k_2 = Polygon(J, M, N, K)
Q = Point(listepoints)
poly9, k_3, l_2, q_1, n_2 = Polygon(K, L, Q, N)
A = Point(listepoints)
poly1, j, c, a_1, m = Polygon(J, C, A, M)
poly2, q, a_2, c_1, l = Polygon(Q, A, C, L)
poly3, a_3, q_2, n, m_2 = Polygon(A, Q, N, M)
a'_1 = Segment(A, M)
j'_1 = Segment(J, C)
k'_3 = Segment(K, L)
l'_2 = Segment(L, Q)
m' = Segment(M, J)
n'_2 = Segment(N, K)
q'_1 = Segment(Q, N)
m'_1 = Segment(M, N)
q' = Segment(Q, A)
j' = Segment(K, J)
l' = Segment(N, K)
l'' = Segment(C, L)
l'''' = Segment(C, A)
k'''' = Segment(M, N)
k''' = Segment(C, A)
B = Point(j_3)
D = Point(l_1)
E = Point(n_1)
F = Intersect(l_1, k_1)
G = Intersect(c_5, l_1)
d = Line(F, G)
e = Segment(B, E)
f = Line(D, e)
H = Intersect(f, c)
g = Segment(H, D)
h = Segment(B, H)
i = Line(E, h)
O = Intersect(d, i)
R = Intersect(i, k_1)
k = Segment(R, D)
p = Segment(E, R)
r = Line(D, e)
S = Intersect(r, l'_2)
s = Segment(E, S)
t = Line(B, s)
T = Intersect(t, c_5)
b_1 = Segment(T, D)
d_1 = Segment(B, T)
e_1 = Segment(D, S)
poly4, b_2, e_2, s_1, d_2, t_1 = Polygon(B, E, S, D, T)
poly5, b_3, e_3, r_1, d_3, h_1 = Polygon(B, E, R, D, H)
z = false