convexhull1.h

使用C++实现的Graham扫描法（求解凸包问题）

// ConvexHull1.h: interface for the CConvexHull class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_CONVEXHULL1_H__5FF4E41F_6118_49EB_8742_14890D622B83__INCLUDED_)
#define AFX_CONVEXHULL1_H__5FF4E41F_6118_49EB_8742_14890D622B83__INCLUDED_

#include "PointArray.h"	// Added by ClassView
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

class CConvexHull  
{
public:
	void Destroy();
	void Graham();
	void QuickSort(CPointArray& pa,CPointNode* prebegin,CPointNode* end);
	int DistanceToP0(CPoint& p1);
	void AngleSort(CPointArray& pa);
	int PointCompare(CPoint &p1,CPoint &p2);
	int DiffMul(CPoint& p0,CPoint& p1,CPoint& p2);
	void LoadPointArray(CPointArray* ppa);
	CPointNode* pP0;
	CPointArray ConvexHullStack;
	CPointArray pointSet;
	CConvexHull();
	virtual ~CConvexHull();

};

#endif // !defined(AFX_CONVEXHULL1_H__5FF4E41F_6118_49EB_8742_14890D622B83__INCLUDED_)