Geografic-Information-System/lib/vector/rtree/split.h

/****************************************************************************
* MODULE:       R-Tree library 
*              
* AUTHOR(S):    Antonin Guttman - original code
*               Daniel Green (green@superliminal.com) - major clean-up
*                               and implementation of bounding spheres
*               Markus Metz - file-based and memory-based R*-tree
*               
* PURPOSE:      Multidimensional index
*
* COPYRIGHT:    (C) 2010 by the GRASS Development Team
*
*               This program is free software under the GNU General Public
*               License (>=v2). Read the file COPYING that comes with GRASS
*               for details.
*****************************************************************************/

/*-----------------------------------------------------------------------------
| Definitions and global variables.
-----------------------------------------------------------------------------*/

/* METHOD 0: R-Tree, quadratic split */
/* METHOD 1: R*-Tree split */
#define METHOD 1

struct PartitionVars {
    int partition[MAXCARD + 1];
    int total, minfill;
    int taken[MAXCARD + 1];
    int count[2];
    struct Rect cover[2];
    RectReal area[2];
};

extern struct Branch BranchBuf[MAXCARD + 1];
extern int BranchCount;
extern struct Rect CoverSplit;
extern RectReal CoverSplitArea;

/* variables for finding a partition */
extern struct PartitionVars Partitions[1];

extern void RTreeInitPVars(struct PartitionVars *, int, int);