Bresenham's line algorithm
id:
bresenham-s-line-algorithm-163-6427937
title:
Bresenham's line algorithm
text:
Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. It is commonly used to draw line primitives in a bitmap image, as it uses only integer addition, subtraction, and bit shifting, all of which are very cheap operations in historically common computer architectures. It is an incremental error algorithm, and one of the earliest algorithms de
brand slug:
wiki
category slug:
encyclopedia
description:
Line-drawing algorithm
original url:
https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm
date created:
2002-07-24T14:43:45Z
date modified:
2024-08-28T09:22:17Z
main entity:
{"identifier":"Q549860","url":"https://www.wikidata.org/entity/Q549860"}
image:
fields total:
13
integrity:
15