Talk:Bresenham's line algorithm: Difference between revisions
Content deleted Content added
suggestions for editing |
response regarding suggestions and a link back to the article |
||
| Line 1: | Line 1: | ||
[[Bresenham's line algorithm]] |
|||
---- |
|||
I miss two things in this article: |
I miss two things in this article: |
||
| Line 5: | Line 7: | ||
I don't know the algorithm myself, so I'll leave it to somebody else. [[User:Jheijmans|Jeronimo]] 14:36 Jul 25, 2002 (PDT) |
I don't know the algorithm myself, so I'll leave it to somebody else. [[User:Jheijmans|Jeronimo]] 14:36 Jul 25, 2002 (PDT) |
||
:I agree and hope that more is contributed. I'll comment my code a little bit later and see what I can do for a small history section and applications section a bit later today. I'd add that it would be nice to see articles for other line algorithms. [[User:Rlee0001|Rlee0001]] 15:20 Jul 25, 2002 (PDT) |
|||
Revision as of 15:20, 25 July 2002
I miss two things in this article:
- the applications of this algorithm. I understand what the algorithm could be used for, but I'm pretty sure not everybody will
- an explanation of how it works and/or comments in the code
I don't know the algorithm myself, so I'll leave it to somebody else. Jeronimo 14:36 Jul 25, 2002 (PDT)
- I agree and hope that more is contributed. I'll comment my code a little bit later and see what I can do for a small history section and applications section a bit later today. I'd add that it would be nice to see articles for other line algorithms. Rlee0001 15:20 Jul 25, 2002 (PDT)