This document discusses evaluating visibility on digital surface models to identify optimal hidden routes between two locations. It outlines calculating visibility maps from a static player's location to determine hidden routes for a moving player to travel between points, accounting for changes to visibility when the static player moves. Software like Python and databases would be used to calculate routes on a PDA with possible transmission to a server. Limitations include GPS fixes in dense forests and effects of seasonal variations.

1. Evaluating visibility on digital surface model to identify optimal (hidden) routes Presented By: Faizan Tayyab

7. Proposed Methodology Presented By: Faizan Tayyab (Positions) Coordinates DSM based Visibility map Calculations (Grid Based Calculations) Routes Calculations Output Routes Position Change Y N

9. Client Server Architecture Presented By: Faizan Tayyab Web Server HTTP HTTP

11. Software Calculations (DSM) Presented By: Faizan Tayyab B A

12. Graphical Hidden Routes Representation Presented By: Faizan Tayyab

13. Visibility Calculations Presented By: Faizan Tayyab