Polygon clipping is one of those humble tasks computers do all the time. It s a basic operation in creating graphic output of all kinds. There are several well-known polygon clipping algorithms, each having its strengths and weaknesses. The oldest one (from 1974) is called the Sutherland-Hodgman algorithm. In its basic form, it is relatively simple. It is also very efficient in two important cases, one being when the polygon is completely inside the boundaries, and the other when it s completely outside.

Packet : 161029polygonclip_demo.zip filelist
ChildView.cpp
ChildView.h
COPYING.txt
MainFrm.cpp
MainFrm.h
PolygonClipDemo.cpp
PolygonClipDemo.exe
PolygonClipDemo.h
PolygonClipDemo.rc
PolygonClipDemo.vcproj
res/
resource.h
res/closepoly.cur
res/PolygonClipDemo.ico
res/PolygonClipDemo.manifest
res/PolygonClipDemo.rc2
stdafx.cpp
stdafx.h
SutherlandHodgman.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．