资 源 简 介
使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。-The use of C++ Realize the Graham scan method (for solving convex hull problems), can be set to generate a random number of points, patterns, and at the same time to support the set display range, display algorithm processing time and the use of document features such as import and export points. (File format for the first four bytes is the number of points, after all points are x coordinates and y coordinates, each account for 4-byte value).
文 件 列 表
ConvexHull
res
ConvexHull.opt
ConvexHullView.h
ConvexHull.rc
ConvexHull1.h
Resource.h
PointArray.h
ConvexHull.aps
ConvexHull.clw
ReadMe.txt
ConvexHull.h
ConvexHull.cpp
StdAfx.h
StdAfx.cpp
MainFrm.h
MainFrm.cpp
ConvexHullDoc.h
ConvexHullDoc.cpp
DlgPointNum.h
ConvexHullView.cpp
PointArray.cpp
ConvexHull.dsp
ConvexHull1.cpp
DlgPointType.h
ConvexHull.dsw
ConvexHull.ncb
DlgPointType.cpp
DlgPointNum.cpp
ConvexHull.plg
PointNode.h
PointNode.cpp
