  We introduce an algorithm to solve linear inverse problems regularized with
the total (gradient) variation in a gridless manner. Contrary to most existing
methods, that produce an approximate solution which is piecewise constant on a
fixed mesh, our approach exploits the structure of the solutions and consists
in iteratively constructing a linear combination of indicator functions of
simple polygons.
