GRASS Programmer's Manual  6.5.svn(2014)-r66266
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
dgraph.c File Reference
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <grass/Vect.h>
#include <grass/gis.h>
#include "dgraph.h"
#include "e_intersect.h"
Include dependency graph for dgraph.c:

Go to the source code of this file.

Data Structures

struct  intersection_point
struct  seg_intersection
struct  seg_intersection_list
struct  seg_intersections


#define LENGTH(DX, DY)   (sqrt((DX*DX)+(DY*DY)))
#define MIN(X, Y)   ((X<Y)?X:Y)
#define MAX(X, Y)   ((X>Y)?X:Y)
#define PI   M_PI


struct seg_intersectionscreate_si_struct (int segments_count)
void destroy_si_struct (struct seg_intersections *si)
void add_ipoint1 (struct seg_intersection_list *il, int with, double dist, int ip)
void add_ipoint (struct line_pnts *Points, int first_seg, int second_seg, double x, double y, struct seg_intersections *si)
void sort_intersection_list (struct seg_intersection_list *il)
double get_epsilon (struct line_pnts *Points)
struct seg_intersectionsfind_all_intersections (struct line_pnts *Points)
struct planar_graphpg_create_struct (int n, int e)
void pg_destroy_struct (struct planar_graph *pg)
int pg_existsedge (struct planar_graph *pg, int v1, int v2)
void pg_addedge1 (struct pg_vertex *v, struct pg_edge *e)
void pg_addedge (struct planar_graph *pg, int v1, int v2)
struct planar_graphpg_create (struct line_pnts *Points)

Macro Definition Documentation

#define LENGTH (   DX,
)    (sqrt((DX*DX)+(DY*DY)))

Definition at line 9 of file dgraph.c.

Referenced by add_ipoint().

#define MAX (   X,
)    ((X>Y)?X:Y)

Definition at line 14 of file dgraph.c.

Referenced by get_epsilon(), and pg_create_struct().

#define MIN (   X,
)    ((X<Y)?X:Y)

Definition at line 11 of file dgraph.c.

#define PI   M_PI

Definition at line 16 of file dgraph.c.

Function Documentation

void add_ipoint ( struct line_pnts *  Points,
int  first_seg,
int  second_seg,
double  x,
double  y,
struct seg_intersections si 
void add_ipoint1 ( struct seg_intersection_list il,
int  with,
double  dist,
int  ip 
void destroy_si_struct ( struct seg_intersections si)
double get_epsilon ( struct line_pnts *  Points)

Definition at line 179 of file dgraph.c.

References MAX, min, intersection_point::x, and y.

void pg_addedge1 ( struct pg_vertex v,
struct pg_edge e 

Definition at line 398 of file dgraph.c.

References pg_vertex::eallocated, pg_vertex::ecount, and pg_vertex::edges.

Referenced by pg_addedge().

struct planar_graph* pg_create_struct ( int  n,
int  e 
void pg_destroy_struct ( struct planar_graph pg)
int pg_existsedge ( struct planar_graph pg,
int  v1,
int  v2 

Definition at line 373 of file dgraph.c.

References pg_vertex::ecount, pg_vertex::edges, planar_graph::v, pg_edge::v1, and pg_edge::v2.

Referenced by pg_addedge().

void sort_intersection_list ( struct seg_intersection_list il)