Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Simon, Klaus Max Planck Society;
Mehlhorn, K., & Simon, K. (1985). Intersecting Two Polyhedra One of which is Convex. In L. Budach (Ed.), Fundamentals of Computation Theory (pp. 534-542). Berlin, Germany: Springer.