| ??? 04/24/09 06:30 Read: times |
#164819 - The Brezingham Line Drawing algorithm Responding to: ???'s previous message |
The Brezingham Line Drawing algorithm (assuming it was spelled Right)
will give you the closest integer step with the least code. They can not all be the same unless it ends up evenly divisable. |
| Topic | Author | Date |
| Values interpolation | 01/01/70 00:00 | |
| A possible start | 01/01/70 00:00 | |
| The Brezingham Line Drawing algorithm | 01/01/70 00:00 | |
| http://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm ? | 01/01/70 00:00 | |
| Good method | 01/01/70 00:00 | |
| Integer Digital Differential Analyzer | 01/01/70 00:00 | |
| Simple scheme... | 01/01/70 00:00 | |
| Further optimization | 01/01/70 00:00 | |
| You are absolutely right, of course,... | 01/01/70 00:00 | |
| Having a hard time trying to understand :( | 01/01/70 00:00 | |
| Clarification Needed | 01/01/70 00:00 | |
| Even more confused now | 01/01/70 00:00 | |
| Another Shot | 01/01/70 00:00 | |
| code | 01/01/70 00:00 | |
| Provided Code | 01/01/70 00:00 | |
| Maybe this | 01/01/70 00:00 | |
Give this a try... | 01/01/70 00:00 | |
| Look it up | 01/01/70 00:00 | |
| Now, we have a hard time to understand... | 01/01/70 00:00 |