split.h 1.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142
  1. /****************************************************************************
  2. * MODULE: R-Tree library
  3. *
  4. * AUTHOR(S): Antonin Guttman - original code
  5. * Daniel Green (green@superliminal.com) - major clean-up
  6. * and implementation of bounding spheres
  7. * Markus Metz - R*-tree
  8. *
  9. * PURPOSE: Multidimensional index
  10. *
  11. * COPYRIGHT: (C) 2009 by the GRASS Development Team
  12. *
  13. * This program is free software under the GNU General Public
  14. * License (>=v2). Read the file COPYING that comes with GRASS
  15. * for details.
  16. *****************************************************************************/
  17. /*-----------------------------------------------------------------------------
  18. | Definitions and global variables.
  19. -----------------------------------------------------------------------------*/
  20. #define METHODS 1
  21. struct PartitionVars {
  22. int partition[MAXCARD + 1];
  23. int total, minfill;
  24. int taken[MAXCARD + 1];
  25. int count[2];
  26. struct Rect cover[2];
  27. RectReal area[2];
  28. };
  29. extern struct Branch BranchBuf[MAXCARD + 1];
  30. extern int BranchCount;
  31. extern struct Rect CoverSplit;
  32. extern RectReal CoverSplitArea;
  33. /* variables for finding a partition */
  34. extern struct PartitionVars Partitions[METHODS];