Intersecting polyhedra with successive planes

An algorithm that computes the intersections of a set of non-overlapping arbitrary polyhedra with a series of planes is described. Each succeeding plane intersection is computed using information from the preceding intersection. Only changes to the preceding intersection are considered, making testing of the polyhedra minimal. Successions of intersecting planes that are translations of one another and those that are rotations of one another are considered.