This table showcases 15K examples from a fast, robust implementation of planar sweeps. The motion comprises of a one-parameter family of rigid motions and is assumed to be closed. In the table, each column corresponds to a generator. 75 in all. Each row corresponds to a motion. 200 in all. The motion may be pure translation or may also include rotation by a total angle of 2π, as indicated. Of the 75 input solids, the first 50 have $C^1$-continuous boundary, which is composed of a single B-spline curve. The remaining 25 solids have $G^1$-discontinuities in the boundary, which is composed of four B-spline curves.The average computation time on a 3.0 GHz CPU was 425 milliseconds. Each cell in the table contains two links: (1) A .pdf file containing four images, viz., the generator curve, the translation part of the motion, the generator shown at a few discrete time instants, and the boundary of the swept volume. (2) An animation of the sweep. Selected examples that illustrate the robustness of the algorithm by capturing fine details: 12-32, 12-33, 43-74, 42-61, 27-5,2π, 27-68,2π, 54-95,2π, 64-95,2π, 65-40,2π, 61-8,2π, etc.