We give a status reort on the TSP with Neighborhoods (TSPN) in geometric domains. Many versions have constant-factor approximations, even PTAS algorithms. Other versions, such as those that define the watchman route in polygons with holes, are harder, with approximations that are polylogarithmic. We survey recent progress on TSPN, including 2D, 3D, and higher dimensional versions, with connections to 2D and 3D variants of the watchman route problem, which requires that we produce one or more tours/trees that provide visibility coverage of a geometric domain.