Description: Demand point set minimum the convex hull Graham algorithm. Given a set of points in the plane, to identify a minimal set of points sequential links forming a convex polygon, so that the point of focus points are inside this polygon or polygons, this convex polygon is to the point set of the two dimensional convex package.
To Search:
File list (Check if you may need any files):
TTestMinvexCoh\TestMinvexCore\MainFrm.cpp
..............\..............\MainFrm.h
..............\..............\ReadMe.txt
..............\..............\res\TestMinvexCore.ico
..............\..............\...\TestMinvexCore.rc2
..............\..............\...\TestMinvexCoreDoc.ico
..............\..............\...\Toolbar.bmp
..............\..............\resource.h
..............\..............\StdAfx.cpp
..............\..............\StdAfx.h
..............\..............\TestMinvexCore.aps
..............\..............\TestMinvexCore.clw
..............\..............\TestMinvexCore.cpp
..............\..............\TestMinvexCore.dsp
..............\..............\TestMinvexCore.dsw
..............\..............\TestMinvexCore.h
..............\..............\TestMinvexCore.ncb
..............\..............\TestMinvexCore.opt
..............\..............\TestMinvexCore.plg
..............\..............\TestMinvexCore.rc
..............\..............\TestMinvexCoreDoc.cpp
..............\..............\TestMinvexCoreDoc.h
..............\..............\TestMinvexCoreView.cpp
..............\..............\TestMinvexCoreView.h
..............\..............\Debug
..............\..............\res
..............\TestMinvexCore
TTestMinvexCoh
Download