GRASS Programmer's Manual 6.4.1(2011)
e_intersect.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Defines

#define FZERO(X, TOL)   (fabs(X)<TOL)
#define FEQUAL(X, Y, TOL)   (fabs(X-Y)<TOL)

Functions

int segment_intersection_2d_tol (double ax1, double ay1, double ax2, double ay2, double bx1, double by1, double bx2, double by2, double *x1, double *y1, double *x2, double *y2, double tol)
int segment_intersection_2d (double ax1, double ay1, double ax2, double ay2, double bx1, double by1, double bx2, double by2, double *x1, double *y1, double *x2, double *y2)
int almost_equal (double a, double b, int bits)

Define Documentation

#define FEQUAL (   X,
  Y,
  TOL 
)    (fabs(X-Y)<TOL)

Definition at line 5 of file e_intersect.h.

Referenced by find_all_intersections(), and segment_intersection_2d_tol().

#define FZERO (   X,
  TOL 
)    (fabs(X)<TOL)

Definition at line 4 of file e_intersect.h.

Referenced by segment_intersection_2d_tol().


Function Documentation

int almost_equal ( double  a,
double  b,
int  bits 
)

Definition at line 912 of file e_intersect.c.

References planar_graph::e, and N.

int segment_intersection_2d ( double  ax1,
double  ay1,
double  ax2,
double  ay2,
double  bx1,
double  by1,
double  bx2,
double  by2,
double *  x1,
double *  y1,
double *  x2,
double *  y2 
)

Definition at line 677 of file e_intersect.c.

References D, DA, DB, MAX, MIN, and SWAP.

Referenced by find_all_intersections().

int segment_intersection_2d_tol ( double  ax1,
double  ay1,
double  ax2,
double  ay2,
double  bx1,
double  by1,
double  bx2,
double  by2,
double *  x1,
double *  y1,
double *  x2,
double *  y2,
double  tol 
)

Definition at line 345 of file e_intersect.c.

References FEQUAL, FZERO, MAX, and MIN.

 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Defines