We are here concerned with the problem of computing the
reachable sets of hybrid systems with linear continuous dynamics and
guards defined by switching hyperplanes. For the reachability analysis
of the continuous dynamics, we use an efficient approximation
algorithm based on zonotopes. In order to use this technique for the
analysis of hybrid systems, we must also deal with the discrete
transitions in a satisfactory (i.e. scalable and accurate) way. For
that purpose, we need to approximate the intersection of the
continuous reachable sets (a union of zonotopes) with the guards
enabling the discrete transitions (a hyperplane).