Description: The basic principle of Bresenham line algorithm is to take the sign of the integer parameter testing, integer values of parameters is proportional to the actual line between the two pixel offset. Bresenham midpoint line algorithm is based on the next point may occur at the midpoint of two points a straight line to determine the location of a point under the trade-off.
To Search:
File list (Check if you may need any files):
直线中点Bresenham算法\InputDlg.cpp
.....................\InputDlg.h
.....................\MainFrm.cpp
.....................\MainFrm.h
.....................\ReadMe.txt
.....................\res\app.ico
.....................\...\draw.ico
.....................\...\exit.ico
.....................\...\Help.ico
.....................\...\kld.bmp
.....................\...\Test.ico
.....................\...\Test.rc2
.....................\...\TestDoc.ico
.....................\...\Toolbar.bmp
.....................\resource.h
.....................\StdAfx.cpp
.....................\StdAfx.h
.....................\Test.aps
.....................\Test.clw
.....................\Test.cpp
.....................\Test.dsp
.....................\Test.dsw
.....................\Test.h
.....................\Test.ncb
.....................\Test.opt
.....................\Test.plg
.....................\Test.rc
.....................\TestDoc.cpp
.....................\TestDoc.h
.....................\TestView.cpp
.....................\TestView.h
.....................\res
直线中点Bresenham算法
Download