#include <qvdta/qvpolyline.h>
Go to the source code of this file.
Defines | |
#define | CONST_PI ((double)3.14159) |
#define | SIGN(X) (((X)>=0)?1:-1) |
#define | xA(Index) (coorX[previous[Index]]) |
#define | yA(Index) (coorY[previous[Index]]) |
#define | xB(Index) (coorX[Index]) |
#define | yB(Index) (coorY[Index]) |
#define | xC(Index) (coorX[next[Index]]) |
#define | yC(Index) (coorY[next[Index]]) |
#define | ABS(X) (((X)>=0)?(X):-(X)) |
#define | TRIANGLE_AREA(I) ABS(xA(I)*yC(I) - xA(I)*yB(I) + xB(I)*yA(I) - xB(I)*yC(I) + xC(I)*yB(I) - xC(I)*yA(I)) |
#define | dist2(A, B) (((A).rx() -(B).rx())*((A).rx() -(B).rx()) + ((A).ry() -(B).ry())*((A).ry() -(B).ry())) |
#define | dot(A, B) ( (A).rx()*(B).rx() + (A).ry()*(B).ry() ) |
Functions | |
void | IterativePointElimination (const QVPolyline &polyline, QVPolyline &result, const double minAreaDiv2) |
Simplifies a contour eliminating points of little area using IPE algorithm. | |
QPoint | linesIntersection (QPoint a, QPoint b, QPoint c, QPoint d) |
void | drawPoints (const QList< QPoint > &hotPoints, QVImage< uChar, 3 > &dest) |
void | drawPoints (const QList< QPoint > &hotPoints, QVImage< uChar > &dest) |
void | draw (QVImage< uChar > &image, const QVPolyline &polyline, const uChar constant, bool linked, bool safe) |
void | draw (QVImage< uChar, 3 > &image, const QVPolyline &polyline, const uChar constant[3], bool linked, bool safe) |
void | draw (QVImage< uChar > &img, const QList< QVPolyline > &polylineList, const uChar constant, bool linked, bool safe) |
void | draw (QVImage< uChar, 3 > &img, const QList< QVPolyline > &polylineList, const uChar constant[3], bool linked, bool safe) |
Definition in file qvpolyline.cpp.