We consider sweeping a polygonal domain using a variable-length segment whose endpoints can be considered to be two mobile agents moving with bounded speeds; a point in the domain is swept when it belongs to the segment. The objective is to sweep the domain as quickly as possible. We prove that the problem is NP-hard even in simple polygons and give constant-factor approximation algorithms, both for simple polygons and polygons with holes.