We deal with the problem of path planning through a 3D terrain in the presence of observers with a view to maximizing the surveillance for a single unmanned air vehicle. A divide and conquer strategy yields a path that locally optimizes the coverage under the given constraints. This is done by finding the points of locally maximum coverage and then forming a graph of such points. This graph can then be used to find an approximation to the optimum path