The porkchop generator
Contours of departure energy C₃ over a grid of 64 × 56 solved Lambert problems: each point is a departure date, a flight time, and the unique single-revolution conic that connects the two planets between them. The cheapest transfer on this grid costs 5.1 km²/s², leaving in Mar 2001 with a flight time of 220 days, against 8.7 for the idealised Hohmann transfer between circular orbits of the same radii. A launch window is a region on this plane, not a moment, and its shape is what a launch period is negotiated against.
2 essays call
porkchop. The drawing above is what it returns with no arguments at all; every
call below passes it something, because a placement that passes nothing draws whichever member
of the family the generator happens to default to rather than the one its essay argues about.
Where it is called
Every figure listed here is the same construction drawn at different numbers, so a correction to one is a correction to all of them.
Two dates decide a mission
Given where a spacecraft leaves from, where it is going, and how long it may take, there is exactly one orbit joining the two. Solving that problem over every pair of departure and arrival dates produces a contour map, and the shape of the contours is what a launch window actually is.
The window that comes back and the cost that does not
Launch opportunities to Mars recur every 780 days exactly, because that is the synodic period and a synodic period is arithmetic. What they cost does not repeat on that interval at all — the cheapest window is a factor of two and a half below the dearest, and the pattern comes back every fifteen years rather than every two.