Wikipedia:Articles for deletion/Bresenham's line algorithm Delphi code
This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record.
The result of the debate was Delete. Rje 15:46, Feb 16, 2005 (UTC)
Bresenham's line algorithm Delphi code[edit]
Same reasoning applies to four pages: Bresenham's line algorithm Delphi code, Bresenham's line algorithm Python code, Bresenham's line algorithm C code, Bresenham's line algorithm Visual basic code. All are just implementations of Bresenham's line algorithm. They might belong in a textbook on computer graphics (perhaps at Wikibooks), but are beyond the scope of an encyclopedia. (There already is an implementation in the Bresenham's line algorithm, to boot.) jdb ❋ 04:30, 7 Feb 2005 (UTC)
- Delete. --Vik Reykja 05:11, 7 Feb 2005 (UTC)
- Delete Different implementions aren't needed. JimmyShelter 09:40, 8 Feb 2005 (UTC)
- Delete. If the code in the main article doesn't describe the algorithm clearly enough, improve it. Gazpacho 04:29, 9 Feb 2005 (UTC)
- Delete. Implementations of this algorithm in different languages aren't helpful. Wile E. Heresiarch 07:15, 9 Feb 2005 (UTC)
- Delete (same for the other languages). The algorithm described in the main article is sufficient, and ports to any other computer language can be made based on this code. An alternative to deleting is moving to Wikisource. — Brim 08:06, Feb 9, 2005 (UTC)
- Transwiki to WikiSource. -- AllyUnion (talk) 12:39, 13 Feb 2005 (UTC)
This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.