Gibson, MatthewKanade, GauravKrohn, ErikVaradarajan, Kasturi2021-12-072021-12-072014-05-301920-180Xhttps://hdl.handle.net/20.500.12588/761We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled (SoCG 2009) and Mustafa and Ray (DCG 2010). Our key contribution is to show the existence of a planar graph that appropriately relates the local and global optimum.en-USAttribution 3.0 United Stateshttp://creativecommons.org/licenses/by/3.0/us/Article