  We investigate the intersection body of a convex polytope using tools from
combinatorics and real algebraic geometry. In particular, we show that the
intersection body of a polytope is always a semialgebraic set and provide an
algorithm for its computation. Moreover, we compute the irreducible components
of the algebraic boundary and provide an upper bound for the degree of these
components.
