离散化曲线.doc.docxVIP

Douglas-Peucker算法 曲线离散化在数字化过程中，需要对曲线进行采样简化，即在曲线上取有限个点，将其变为折线，并且能够在一定程度上保持原有的形状。经典的Douglas-Peucker算法描述如下：（1）在曲线首尾两点A，B之间连接一条直线AB，该直线为曲线的弦；（2）得到曲线上离该直线段距离最大的点C，计算其与AB的距离d；（3）比较该距离与预先给定的阈值threshold的大小，如果小于threshold，则该直线段作为曲线的近似，该段曲线处理完毕。（4）如果距离大于阈值，则用C将曲线分为两段AC和BC，并分别对两段取信进行1~3的处理。（5）当所有曲线都处理完毕时，依次连接各个分割点形成的折线，即可以作为曲线的近似。Douglas-Peucker算法源代码下载/*sample.cpp*/#include iostream#include vector#include DouglasPeucker.husing namespace std;void readin(vectorMyPointStruct Points,const char * filename){MyPointStruct SinglePoint;FILE *fp = fopen(filename,r);while(fscanf(fp,%lf%lf,SinglePoint.X,SinglePoint.Y)!=EOF){?? Points.push_back(SinglePoint);}}void DouglasPeuckerAlgorithm(vectorMyPointStruct Points,int tolerance,const char*filename){DouglasPeucker Instance(Points,tolerance);Instance.WriteData(filename);}void DumpOut1(){printf(done!\n);}void DumpOut2(){printf(need 3 command line parameter:\n[0]executable file name;\n[1]file name of the input data;\n[2]file name of the output data;\n[3]threshold.\n);}int main(int argc, const char *argv[]){if(argc==4){?? vectorMyPointStruct Points;?? readin(Points,argv[1]);?? int threshold = atoi(argv[3]);???? DouglasPeuckerAlgorithm(Points,threshold,argv[2]);?? DumpOut1();}else{?? DumpOut2();}return 0;}///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////*DouglasPeucker.h*/#ifndef DOUGLAGPEUCKER#include math.h#include vectorusing namespace std;struct MyPointStruct // 点的结构{public: double X;double Y;double Z;MyPointStruct(){?? this-X = 0;?? this-Y = 0;?? this-Z = 0;};MyPointStruct(double x, double y, double z) // 点的构造函数{?? this-X = x;?? this-Y = y;?? this-Z = z;};~MyPointStruct(){};};class DouglasPeucker{public:vectorMyPointStruct PointStruct;vectorbool myTag; // 标记特征点的一个bool数组vectorint PointNum;//离散化得到的点号DouglasPeucker(void){};DouglasPeucker(vectorMyPointStruct Points,int tolerance);~DouglasPeucker(){};void WriteData(const char *filename);priva