ブレゼンハムのアルゴリズム
1. Bresenham's line algorithmThe Bresenham line algorithm is an algorithm which determines which points in an n-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points. It is commonly used to draw lines on a computer screen, as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in standard computer architectures. It is one of the earliest algorithms developed in the field of computer graphics.
Read “Bresenham's line algorithm” on English Wikipedia
Read “ブレゼンハムのアルゴリズム” on Japanese Wikipedia
Read “Bresenham's line algorithm” on DBpedia
Read “Bresenham's line algorithm” on English Wikipedia
Read “ブレゼンハムのアルゴリズム” on Japanese Wikipedia
Read “Bresenham's line algorithm” on DBpedia
Discussions
Log in to talk about this word.