Revision as of 06:40, 11 February 2015 edit Dicklyon (talk \| contribs) Autopatrolled, Extended confirmed users, Rollbackers 486,013 edits ce hatnote ← Previous edit		Revision as of 06:41, 11 February 2015 edit undo Dicklyon (talk \| contribs) Autopatrolled, Extended confirmed users, Rollbackers 486,013 edits →Algorithm: cleanup Next edit →
Line 17: == Algorithm == The DDA starts by calculating the smaller of dy or dx for a unit increment of the other... A line is then sampled at unit intervals in one coordinate and corresponding integer values nearest the line path are determined for the other coordinate. Considering a line with positive slope, if the slope is less than or equal to 1, we sample at unit x intervals (dx=1) and compute successive y values as

Digital differential analyzer (graphics algorithm): Difference between revisions