Unlike in various applications, where the gradient of a two dimensional matrix is calculated in x and y direction, the gradient of a digital elevation model (DEM) is usually returned as the steepest gradient. The steepest gradient is the largest downward slope of a pixel to one of its eight neighbors.
In this problem, your task will be to return the linear index of the steepest neighbor for each pixel in a gridded DEM. Pixels that don't have downward neighbors should receive the index value zero.
An example should help. The DEM is
dem = [1 5 9; ... 4 5 6; ... 8 7 3];
The result should be
IX = [0 1 4; ... 1 1 9; ... 2 9 0];
The results may not be unique, but the test cases have been built so that this is not a problem. The spatial resolution of the dem is dx=1 and dy=1. Note that the diagonal distance is hypot(dx,dy).
I'v developed the code using padarray and ordfilt2, which satisfies the test suite on my system, but seems like cody doesn't support padarray, is this so??
Hi Dishant, I thought the IPT is available, too, but apparently Cody does not support toolboxes at this time. see box on the right hand side: http://www.mathworks.de/matlabcentral/about/cody/
More difficult thant expected...
73 Solvers
Sum all integers from 1 to 2^n
6327 Solvers
Is this date a palindrome?emordnilap a etad siht sI
28 Solvers
104 Solvers
Flag largest magnitude swings as they occur
524 Solvers