三角网的生成算法.docVIP

三角网的生成算法 #ifndef TIN_H#define TIN_H#includeiostream#includecmath#includevector#includefstream#includeWGraphics.husing namespace std;typedef struct mo{?int m;?int n;?int mark;}mo;typedef struct o{?double x;?double y;}Point;typedef struct sample//文件读入的采样点结构{?Point point;?int Mark;?int Number;//采样点编号}Sample;class TIN{public:?void GetData();? ?void Display(int scale);?//---------------------------------------------------------------------?~TIN()?{?delete [] dot; }?inline double Distance(Point p1,Point p2)//计算两点之间的距离?{?return(sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p