Functions |
void | pal::heapsort (int *sid, int *id, const double *const x, int N) |
void | pal::heapsort2 (int *x, double *heap, int N) |
bool | pal::isSegIntersects (double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4) |
bool | pal::computeSegIntersectionExt (double x1, double y1, double x2, double y2, double xs1, double ys1, double x3, double y3, double x4, double y4, double xs2, double ys2, double *x, double *y) |
bool | pal::computeLineSegIntersection (double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4, double *x, double *y) |
bool | pal::computeSegIntersection (double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4, double *x, double *y) |
bool | pal::computeLineIntersection (double x1, double y1, double x2, double y2, double x3, double y3, double x4, double y4, double *x, double *y) |
int | pal::convexHullId (int *id, const double *const x, const double *const y, int n, int *&cHull) |
int | pal::reorderPolygon (int nbPoints, double *x, double *y) |
bool | pal::isPointInPolygon (int npol, double *xp, double *yp, double x, double y) |
void | pal::findLineCircleIntersection (double cx, double cy, double radius, double x1, double y1, double x2, double y2, double &xRes, double &yRes) |