Jump to content

Bresenham's line algorithm: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

26 May 2024

19 May 2024

17 April 2024

30 March 2024

24 February 2024

13 February 2024

28 January 2024

15 January 2024

10 January 2024

23 November 2023

  • curprev 04:2104:21, 23 November 20232607:f2c0:e2a2:a5:59a9:989b:9aba:551 talk 21,890 bytes −150 I removed what seems to be an incorrect statement. Looking at the code, it looks like it always starts from the x0, y0 point and goes to the x1, y1 point. Looking the referenced PDF, it looks like the "ordering" it was talking about is a property of the algorithm that allows you start drawing the line from either end. undo

8 November 2023

3 November 2023

11 October 2023

4 October 2023

28 September 2023

25 August 2023

4 July 2023

16 May 2023

  • curprev 19:5919:59, 16 May 2023103.106.88.59 talk 21,871 bytes −56 Remove the reference to x86_64, which is decades newer than the article subject and doesn't have any real world implementations lacking a Floating Point Unit (Which is related to the point of the previously cited operations being cheap.) undo

7 May 2023

21 March 2023

20 March 2023

16 March 2023

15 March 2023

13 January 2023

25 December 2022

2 December 2022

29 November 2022

27 November 2022

22 November 2022

21 November 2022

20 October 2022

20 September 2022

18 September 2022

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)