Bresenham Line Drawing Algorithm (Q21): Difference between revisions
(Created claim: resource (P21): Quiz:Bresenham (Q354)) |
(Changed [en] description: A simple and fast algorithm to approximate a straight line between two points using pixels) |
||
| (7 intermediate revisions by one other user not shown) | |||
| aliases / en / 0 | aliases / en / 0 | ||
Bresenham's line algorithm | |||
| aliases / en / 1 | aliases / en / 1 | ||
Bresenham Line | |||
| description / en | description / en | ||
A simple and fast algorithm to approximate a straight line between two points using pixels | |||
| Property / resource | |||
| Property / resource: Article: How to draw ugly lines really fast / rank | |||
Normal rank | |||
| Property / resource | |||
| Property / resource: Jupyter notebook: Rotating Clock / rank | |||
Normal rank | |||
Latest revision as of 10:17, 4 June 2024
A simple and fast algorithm to approximate a straight line between two points using pixels
- Bresenham's line algorithm
- Bresenham Line
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bresenham Line Drawing Algorithm |
A simple and fast algorithm to approximate a straight line between two points using pixels |
|