道格拉斯普克压缩算法.docVIP

道格拉斯普克压缩算法 #include algorithm using namespace std; struct FromTo { int from; int to; }; vector DouglasPeuckerDataCompress(vector pts,double tolerance) { double distance = 0; int nStart = 0; int nEnd = pts.size()-1; int numPt = 0; bool flag = true; FromTo from_to; vector Stack; vector numPoints; numPoints.push_back(0); do { distance = GetMaxArcLength(pts,nStart,nEnd,numPt); if (distance tolerance) { numPoints.push_back(numPt); from_to.from = numPt; from_to.to = nEnd; Stack.push_back(from_to); nEnd = numPt; } else { if (Stack.empty()) flag = false; else { from_to = Stack[Stack.size()-1]; nStart = from_to.from; nEnd = from_to.to; Stack.erase(Stack.end()-1); } } } while(flag); numPoints.push_back(pts.size()-1); vector pnts; for (int i = 0; i != pts.size(); ++i) { if (find(numPoints.begin(),numPoints.end(),i) != numPoints.end()) pnts.push_back(pts[i]); } return pnts; } double GetMaxArcLength(vector pts,int nStart,int nEnd,int numPoint) { double maxLength = 0; double distance = 0; for (int i = nStart+1; i != nEnd; ++i) { distance = DistancePointToLine(pts[i],pts[nStart],pts[nEnd]); if (distance maxLength) { maxLength = distance; numPoint = i; } } return maxLength; } double DistancePointToLine(pointD pt,pointD pt1,pointD pt2) { if (!DoubleEqual(pt1.x,pt2.x)) //不垂直 { double k1 = (pt2.y - pt1.y)/(pt2.x - pt1.x); double b1 = pt2.y - pt2.x * k1; if (!DoubleEqual(0,k1)) { double k2 = (-1)/k1; double b2 = pt.y - k2 * pt.x; pointD pt3; pt3.x = (b2 - b1)/(k1 - k2); pt3.y = pt3.x * k1 + b1; return GetDistance(pt,pt3); } else //直线水平 return fabs(pt.y - pt1.y); } else //直线垂直 return fabs(pt2.x - pt.x); }