Robust approximation of offsets and bisectors of plane curves

Most methods for computing offsets and bisectors of parametric curves are based on a local formulation of the distance to a curve. As a consequence, the computed objects may contain spurious parts and components, and have to be trimmed. We approach these problems as global optimization problems, and solve them using interval arithmetic, thus generating robust approximations that need not be trimmed.