Abstract
Whereas traditional approaches to implicitization of rational parametric curves have focused on exact methods, the past two decades have seen increased interest in the application of approximate methods for implicitization. In this talk we will discuss how the properties of the Chebyshev polynomial basis can be used to improve the speed, stability and approximation quality of existing algorithms for approximate implicitization. We will also look at how the algorithm is well suited to parallelization.