Delaunay三角网的构建算法VC

问题描述：

输入：凸包点集
输出：构成的所有三角形
现给出点结构和类的定义
struct Point {
double x;
double y;
double z;
Point(double a=0, double b=0, double c=0) { x=a; y=b; z=c;} //constructor
};
class Triangle : public CObject
{
public:
Triangle();
Triangle(Point a,Point b,Point c);
virtual ~Triangle();
public:
Point GetPointA();
Point GetPointB();
Point GetPointC();
void SetPointA(Point PointA);
void SetPointB(Point PointB);
void SetPointC(Point PointC);
public:
BOOL IsInExternalCircle(Point AScatteredPoint);
private:
Point m_PointC;
Point m_PointB;
Point m_PointA;
double m_ExternalCircleR;
};

问题解答：

这种论文级别的题目...................不会