#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include "pathplan.h"
#include "solvers.h"
Include dependency graph for route.c:
Go to the source code of this file.
Data Structures | |
struct | tna_t |
struct | p2e_t |
struct | elist_t |
Defines | |
#define | EPSILON1 1E-3 |
#define | EPSILON2 1E-6 |
#define | ABS(a) ((a) >= 0 ? (a) : -(a)) |
#define | prerror(msg) fprintf (stderr, "libpath/%s:%d: %s\n", __FILE__, __LINE__, (msg)) |
#define | DISTSQ(a, b) |
#define | POINTSIZE sizeof (Ppoint_t) |
#define | LT(pa, pbp) ((pa.y > pbp->y) || ((pa.y == pbp->y) && (pa.x < pbp->x))) |
#define | GT(pa, pbp) ((pa.y < pbp->y) || ((pa.y == pbp->y) && (pa.x > pbp->x))) |
Functions | |
int | Proutespline (Pedge_t *edges, int edgen, Ppolyline_t input, Ppoint_t *evs, Ppolyline_t *output) |
#define DISTSQ | ( | a, | |||
b | ) |
#define GT | ( | pa, | |||
pbp | ) | ((pa.y < pbp->y) || ((pa.y == pbp->y) && (pa.x > pbp->x))) |
#define LT | ( | pa, | |||
pbp | ) | ((pa.y > pbp->y) || ((pa.y == pbp->y) && (pa.x < pbp->x))) |
#define prerror | ( | msg | ) | fprintf (stderr, "libpath/%s:%d: %s\n", __FILE__, __LINE__, (msg)) |
int Proutespline | ( | Pedge_t * | edges, | |
int | edgen, | |||
Ppolyline_t | input, | |||
Ppoint_t * | evs, | |||
Ppolyline_t * | output | |||
) |
Definition at line 109 of file route.c.
References Pedge_t::a, Pedge_t::b, p2e_t::ep, GT, LT, malloc(), NULL, Ppoly_t::pn, p2e_t::pp, prerror, Ppoly_t::ps, Pxy_t::x, and Pxy_t::y.