We develop an efficient algorithm for the construction of common tangents between a set of Bezier curves. Common tangents are important in visibility, lighting, robot motion, and convex hulls. Common tangency is reduced to the intersection of parametric curves in a dual space, rather than the traditional intersection of implicit curves. We show how to represent the tangent space of a plane Bezier curve as a plane rational Bezier curve in the dual space, and compare this representation to the hodograph and the dual Bezier curve. The detection of common tangents that map to infinity is resolved by the use of two cooperating curves in dual space, clipped to avoid redundancy. We establish the equivalence of our solution in dual space to a solution in Plucker space, where all the same issues are encountered in a higher-dimensional context.