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!

0102050202
..........\Debug
..........\MainFrm.cpp
..........\MainFrm.h
..........\MyGraphicsExercise.aps
..........\MyGraphicsExercise.clw
..........\MyGraphicsExercise.cpp
..........\MyGraphicsExercise.dsp
..........\MyGraphicsExercise.dsw
..........\MyGraphicsExercise.h
..........\MyGraphicsExercise.ncb
..........\MyGraphicsExercise.opt
..........\MyGraphicsExercise.plg
..........\MyGraphicsExercise.rc
..........\MyGraphicsExerciseDoc.cpp
..........\MyGraphicsExerciseDoc.h
..........\MyGraphicsExerciseView.cpp
..........\MyGraphicsExerciseView.h
..........\ReadMe.txt
..........\res

..........\...\MyGraphicsExercise.rc2


..........\Resource.h
..........\StdAfx.cpp
..........\StdAfx.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．