split_q.h 1.3 KB

12345678910111213141516171819202122232425262728293031323334353637383940
  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. *
  8. * PURPOSE: Multidimensional index
  9. *
  10. * COPYRIGHT: (C) 2001 by the GRASS Development Team
  11. *
  12. * This program is free software under the GNU General Public
  13. * License (>=v2). Read the file COPYING that comes with GRASS
  14. * for details.
  15. *****************************************************************************/
  16. /*-----------------------------------------------------------------------------
  17. | Definitions and global variables.
  18. -----------------------------------------------------------------------------*/
  19. #define METHODS 1
  20. struct PartitionVars {
  21. int partition[MAXCARD + 1];
  22. int total, minfill;
  23. int taken[MAXCARD + 1];
  24. int count[2];
  25. struct Rect cover[2];
  26. RectReal area[2];
  27. };
  28. extern struct Branch BranchBuf[MAXCARD + 1];
  29. extern int BranchCount;
  30. extern struct Rect CoverSplit;
  31. extern RectReal CoverSplitArea;
  32. /* variables for finding a partition */
  33. extern struct PartitionVars Partitions[METHODS];