Introduction - If you have any usage issues, please Google them yourself
computer graphics design, realization of line drawing, Circle, drawing polygons, DDA algorithm used for line drawing, Bresenham algorithm using Circle. There achieve regional and filled polygon clipping and filled with seed filling algorithm, Polygon is using the cutting Sutherland_Hodgman algorithm! The procedure is only achieve these algorithms to use, can also make perfect! Thank you!
Packet : 456659930102050202.rar filelist
0102050202\MyGraphicsExercise.clw
0102050202\ReadMe.txt
0102050202\MyGraphicsExercise.h
0102050202\MyGraphicsExercise.cpp
0102050202\StdAfx.h
0102050202\StdAfx.cpp
0102050202\MyGraphicsExerciseDoc.h
0102050202\MyGraphicsExerciseDoc.cpp
0102050202\MyGraphicsExercise.dsw
0102050202\MyGraphicsExercise.ncb
0102050202\MyGraphicsExercise.plg
0102050202\MainFrm.cpp
0102050202\MainFrm.h
0102050202\MyGraphicsExercise.dsp
0102050202\Resource.h
0102050202\MyGraphicsExercise.aps
0102050202\MyGraphicsExercise.rc
0102050202\MyGraphicsExerciseView.h
0102050202\MyGraphicsExerciseView.cpp
0102050202\MyGraphicsExercise.opt
0102050202\Debug
0102050202\res\MyGraphicsExercise.rc2
0102050202\res\MyGraphicsExerciseDoc.ico
0102050202\res\MyGraphicsExercise.ico
0102050202\res\Toolbar.bmp
0102050202\res
0102050202