Cavalieri's Principle Demo: Equal Volumes of Prisms

Cavalieri's Principle Demo: Equal Volumes of Prisms
Loading the math board and drawing, please wait…
2016-04-10 07:27
This example illustrates Cavalieri's principle by constructing two prisms of equal height whose cross‑sectional areas match at every level, thereby showing their volumes are equal. Core concepts include Cavalieri's principle, solid‑geometry volume computation, cross‑sectional area comparison, and properties of prisms and polyhedra. Construction uses Polygon for base faces, Prism to generate the solids, CurveCartesian and Surface for sectional curves and surfaces, and Point, OrthogonalPlane, Intersect, PointIn to create vertices, orthogonal planes, intersection lines, and interior points, yielding a complete 3D model. Suitable for high‑school solid geometry lessons, university calculus introductions to volume integrals, and as a resource for geometric construction and animation demonstrations.

GeoGebra Commands & Parameters

  1. Polygon((1, 0, -2), (2, -3, -2), (3, 2, -2)) → poly1, a, b, c
  2. Prism(poly1, 6) → d, A, edge3, edgeAB, edgeBC, edgeAC, B, C, face1, face3, face2, faceABC, edge1, edge2
  3. Polygon((-4, 0, -2), (-3, -3, -2), (-2, 2, -2)) → poly2, e, f, g
  4. CurveCartesian(sin((π / 3 * (t + 2))) - 4, 0, t, t, -2, 4) → i
  5. CurveCartesian(sin((π / 3 * (t + 2))) - 3, -3, t, t, -2, 4) → j
  6. Polygon((-4, 0, 4), (-3, -3, 4), (-2, 2, 4)) → poly3, h, l, m
  7. CurveCartesian(sin((π / 3 * (t + 2))) - 2, 2, t, t, -2, 4) → k
  8. Surface((u * (sin((π / 3 * (t + 2))) - 4)) + ((1 - u) * (sin((π / 3 * (t + 2))) - 3)), (u * 0) + ((1 - u) * (-3)), t, t, -2, 4, u, 0, 1) → n
  9. Surface((u * (sin((π / 3 * (t + 2))) - 4)) + ((1 - u) * (sin((π / 3 * (t + 2))) - 2)), (u * 0) + ((1 - u) * 2), t, t, -2, 4, u, 0, 1) → o
  10. Surface((u * (sin((π / 3 * (t + 2))) - 2)) + ((1 - u) * (sin((π / 3 * (t + 2))) - 3)), (u * 2) + ((1 - u) * (-3)), t, t, -2, 4, u, 0, 1) → p
  11. CurveCartesian(-6, 0, t, t, -10, 10) → q
  12. Point(q) → E
  13. OrthogonalPlane(E, zAxis) → r
  14. Intersect(edge2, r) → F
  15. Intersect(edge3, r) → G
  16. Intersect(edge1, r) → H
  17. Polygon(H, G, F) → poly4, f_1, h_1, g_1
  18. CurveCartesian((u * (sin((π / 3 * (z(E) + 2))) - 4)) + ((1 - u) * (sin((π / 3 * (z(E) + 2))) - 3)), (u * 0) + ((1 - u) * (-3)), z(E), u, 0, 1) → s
  19. Polygon(I, J, K) → poly5, k_1, i_1, j_1
  20. PointIn(poly4) → Pointpoly4
  21. PointIn(poly5) → Pointpoly5