Description: In the definition of the window, we simply window graphics are displayed, in addition to window graphics we are not concerned. Therefore, the need to cut down the graphics outside the window. In this data, to achieve the following sections of the cut line algorithm: Cohen-Sutherland algorithm, the mid-point division algorithm, Liangyou Dong-Barsky algorithm, and using Sutherland-Hodgman polygon clipping algorithm, and finally, to achieve when the cutting domain is arbitrary when the convex polygon clipping algorithm.
File list (Check if you may need any files):
cutout\cut.aps
......\cut.clw
......\cut.cpp
......\cut.dsp
......\cut.dsw
......\cut.h
......\cut.ncb
......\cut.opt
......\cut.plg
......\cut.rc
......\cutDoc.cpp
......\cutDoc.h
......\cutView.cpp
......\cutView.h
......\Debug\cut.exe
......\.....\cut.ilk
......\.....\cut.obj
......\.....\cut.pch
......\.....\cut.pdb
......\.....\cut.res
......\.....\cutDoc.obj
......\.....\cutView.obj
......\.....\MainFrm.obj
......\.....\StdAfx.obj
......\.....\vc60.idb
......\.....\vc60.pdb
......\MainFrm.cpp
......\MainFrm.h
......\ReadMe.txt
......\res\cut.ico
......\...\cut.rc2
......\...\cutDoc.ico
......\...\Toolbar.bmp
......\resource.h
......\StdAfx.cpp
......\StdAfx.h
......\Debug
......\res
cutout
Download