Few days back, I came across this
problem in one of the mailing list. The problem is about counting the no of squares which are internally intersected by a line in a square grid of unit size.I just wanted to solve this problem somehow and did a bit of research for it. I experimented out with various solutions like using some vector algebra methods
(
Read more... )