You might repeat the algorithm for getting the first ring on each cell that
makes up that ring.
A lazy way to do it would be to exclude the cell that the ring is
originating from, and any cells that have already been found.
A better solution would be to get the angle between the center and the
p
[0,0] [1,0] [2,0] [3,0] [4,0]
[0,1] [1,1] [2,1] [3,1] [4,1]
[0,2] [1,2] [2,2] [3,2] [4,2]
[0,3] [1,3] [2,3] [3,3] [4,3]
[0,4] [1,4] [2,4] [3,4] [4,4]
I have the following grid and would like to find the neighbouring
positions of a certain point, going in a radius from in to out, covering
all th
2 matches
Mail list logo