The recently developed Generalized Mapping Theorem provides a means to synthesize convex-hull generator points for uncertain polynomials and transfer functions. However, its application requires maximizing a projection onto a unit ray over a uniform grid of angles, which is inefficient and ignores the errors associated with a finite grid. The algorithm developed in this paper addresses both of these issues by characterizing errors and synthesizing generator points only when needed to meet a given convergence tolerance.