Shortest Path Optimization with 3D Vectors

This example dynamically illustrates finding the shortest path in space using geometric reflection. Core concepts include optimization extrema, 3D vector rotation, and limits. Construction relies on Segment for paths, LineBisector and Intersect for reflection points, plus Point and Distance commands on objects A, A', f, g, B, C, D and lists. Ideal for high-school solid geometry and undergraduate coordinate geometry to explore optimization and curve construction.