RTree performance compromise

git-svn-id: https://svn.osgeo.org/grass/grass/trunk@38642 15284696-431f-4ddb-bdfa-cd5b030d7da7

lib/vector/rtree/index.h

@@ -45,10 +45,10 @@ typedef double RectReal;
  * this is LFS dependent, not good
  * on 32 bit without LFS this is 9.69
  * on 32 bit with LFS and on 64 bit this is 9 */
-#define MAXCARD 10
+#define MAXCARD 9
 
 /* R*-tree: number of branches to be force-reinserted when adding a branch */
-#define FORCECARD 3
+#define FORCECARD 2
 
 /* maximum no of levels = tree depth */
 #define MAXLEVEL 20        /* 4^MAXLEVEL items are guaranteed to fit into the tree */

lib/vector/rtree/split.c

@@ -85,7 +85,7 @@ static void RTreeClassify(int i, int group, struct PartitionVars *p,
 
 /**********************************************************************
  *                                                                    *
- *            Toni Guttmann's quadratic splitting method              *
+ *            Toni Guttman's quadratic splitting method              *
  *                                                                    *
  **********************************************************************/
 
@@ -207,7 +207,7 @@ static void RTreePrintPVars(struct PartitionVars *p)
 }
 
 /*----------------------------------------------------------------------
-| Method #0 for choosing a partition: this is Toni Guttmann's quadratic
+| Method #0 for choosing a partition: this is Toni Guttman's quadratic
 | split
 |
 | As the seeds for the two groups, pick the two rects that would waste