DDA Algorithm and Bresenham Algorithm

687 Views Asked by At

I have been studying DDA and Bresenham algorithms for line drawing and am curious about one thing.In both the algorithms,we consider a pixel grid to be of unit size and perform further steps.My question is if I change my grid size to say 0.5*0.5 instead of 1*1 grid,will there be any changes reflected in the way both algorithms work.If yes,can somebody enlighten me as to what those changes will be in each algorithm respectively.Very curious to know.Thanks for your answers in advance.Anybody who can help,please do so,since it urgent.I have an exam and I want this concept clarified.Please.Thanks:)

0

There are 0 best solutions below