v_data * UG_graph(double *x, double *y, int n)
surface_t * mkSurface(double *x, double *y, int n, int *segs, int nsegs)
int * delaunay_tri(double *x, double *y, int n, int *nedges)
int * get_triangles(double *x, int n, int *ntris)
void freeSurface(surface_t *s)
static int nedges
total no. of edges used in routing