Browsing Computer Science and Automation (CSA) by Advisor "De, Minati"
Now showing items 1-1 of 1
-
Guarding Terrain using k-Watchtowers
The discrete k-watchtower problem for a polyhedral terrain T in R3 with n vertices is to nd k vertical segments, called watchtowers, of smallest height, whose bottom end-points (bases) lie on some vertices of T, and ...