myconvexhull.h

凸包算法在VC6下实现

// MyConvexHull.h: interface for the CMyConvexHull class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_MYCONVEXHULL_H__08337D16_85E9_4931_A40C_01764435571C__INCLUDED_)
#define AFX_MYCONVEXHULL_H__08337D16_85E9_4931_A40C_01764435571C__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#define MaxNode 800000

class CMyConvexHull  : public CEdit
{
public:
	CMyConvexHull();
	virtual ~CMyConvexHull();
	int GetN(); //	
	void InputData(CString);
	void Solve();
	void Operation();    
    struct Nodes{
		int x, y;
	}node[MaxNode], temp[MaxNode];
	int V[MaxNode*2], back, front;
    int N;

private:	
    void right_scan(int);
	void left_scan(int);
	void MergeSort(int, int);
	void Merge(int, int, int);
	bool cmp(Nodes, Nodes);
	int cross(Nodes, Nodes, Nodes);
};

#endif // !defined(AFX_MYCONVEXHULL_H__08337D16_85E9_4931_A40C_01764435571C__INCLUDED_)