tree_utils.h

/***********************************************************************
 *                   gnu lesser general Public license
 *
 * this file is part of the gfdl flexible modeling system(fms).
 *
 * fms is free software: you can redistribute it and/or modify it under
 * the terms of the gnu lesser general Public license as published by
 * the free software foundation, either version 3 of the license, or(at
 * your option) any later version.
 *
 * fms is distributed in the hope that it will be useful, but without
 * any warranty; without even the implied warranty of merchantability or
 * fitness for a particular purpose.  see the gnu general Public license
 * for more details.
 *
 * you should have received a copy of the gnu lesser general Public
 * license along with fms.  If not, see <http://www.gnu.org/licenses/>.
 **********************************************************************/
/***********************************************************************
                      mosaic_util.h
    this header file provide some utilities routine that will be used in many tools.
 
    contact: zhi.liang@noaa.gov
***********************************************************************/
#ifndef TREE_UTILS_H_
#define TREE_UTILS_H_
 
#ifndef MAXNODELIST
#define MAXNODELIST 100
#endif
 
struct node{
  double x, y, z, u, u_clip;
  int intersect; /* indicate if this point is an intersection, 0 = no, 1= yes, 2=both intersect and vertices */
  int inbound;      /* -1 uninitialized, 0 coincident, 1 outbound, 2 inbound */
  int initialized; /* = 0 means empty list */
  int isinside;   /* = 1 means one point is inside the other polygon, 0 is not, -1 undecided. */
  int subj_index; /* the index of subject point that an intersection follow. */
  int clip_index; /* the index of clip point that an intersection follow */
  struct node *next;
};
 
void rewindlist(void);
 
struct node *getnext();
 
void initnode(struct node *node);
 
void addend(struct node *list, double x, double y, double z, int intersect, double u, int inbound, int inside);
 
int addintersect(struct node *list, double x, double y, double z, int intersect, double u1, double u2,
                 int inbound, int is1, int ie1, int is2, int ie2);
 
int length(struct node *list);
 
int samenode(struct node node1, struct node node2);
 
void addnode(struct node *list, struct node nodein);
 
struct node *getnode(struct node *list, struct node innode);
 
struct node *getnextnode(struct node *list);
 
void copynode(struct node *node_out, struct node node_in);
 
void printnode(struct node *list, char *str);
 
int intersectinlist(struct node *list, double x, double y, double z);
 
void insertintersect(struct node *list, double x, double y, double z, double u1, double u2, int inbound,
                     double x2, double y2, double z2);
 
void insertafter(struct node *list, double x, double y, double z, int intersect, double u, int inbound,
                 double x2, double y2, double z2);
 
double gridarea(struct node *grid);
 
int isintersect(struct node node);
 
int getinbound( struct node node );
 
struct node *getlast(struct node *list);
 
int getfirstinbound( struct node *list, struct node *nodeout);
 
void getcoordinate(struct node node, double *x, double *y, double *z);
 
void getcoordinates(struct node *node, double *p);
 
void setcoordinate(struct node *node, double x, double y, double z);
 
void setinbound(struct node *interlist, struct node *list);
 
int isinside(struct node *node);
 
int insidepolygon( struct node *node, struct node *list);
 
#endif