Skip to content

Latest commit

 

History

1 Commit

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 

Repository files navigation

Watch Tower is a Computational Geometry problem in which we are suposed to find the min number of towers we need to cover a terrain. In this code, you can specify the points (in the input.txt) to draw the terrain, and also the location of the tower in (x,y) format, and its length, and the code shows you wich parts of the terrain are visible (green parts), and which parts are not.

About

Detecting the visible regions of a terrain, given the location and strength of a watchtower

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages