Polyhedral Surface Approximation

Given a triangulated surface $S\subset\mathbb{R}^3$ and $\varepsilon>0$, construct a polyhedral surface $S'$ whose distance from $S$ is at most $\varepsilon$ and whose combinatorial complexity is as small as possible. Determine efficient algorithms with provable approximation guarantees for general input surfaces.