static void |
Entry.calcBoundingBox(Entry<?>[] entries,
int start,
int end,
double[] minOut,
double[] maxOut) |
|
static double |
Entry.calcCenterDistance(Entry<?> e1,
Entry<?> e2) |
|
static double |
Entry.calcDeadspace(Entry<?>[] entries,
int start,
int end,
double[] minOut,
double[] maxOut) |
Calculates the bounding boxes and the estimated dead space.
|
static double |
Entry.calcVolume(Entry<?> e) |
|
static boolean |
Entry.checkOverlap(double[] min,
double[] max,
Entry<?> e) |
|
<T> org.tinspin.index.rtree.RTreeNode<T> |
RStarTreeLogic.chooseSubTree(org.tinspin.index.rtree.RTreeNode<T> root,
Entry<T> e,
int desiredInsertionLevel,
int nLevels) |
Choose subtree as described in the paper.
|
<T> org.tinspin.index.rtree.RTreeNode<T> |
RTreeLogic.chooseSubTree(org.tinspin.index.rtree.RTreeNode<T> root,
Entry<T> e,
int desiredInsertionLevel,
int nLevels) |
|
void |
RTree.insert(Entry<T> e) |
Insert an entry.
|
void |
RTree.load(Entry<T>[] entries) |
|
void |
STRLoader.load(Entry<T>[] entries) |
|
<T> Entry<T>[] |
RStarTreeLogic.reInsert(org.tinspin.index.rtree.RTreeNode<T> node,
Entry<T> e) |
|
<T> Entry<T>[] |
RTreeLogic.reInsert(org.tinspin.index.rtree.RTreeNode<T> node,
Entry<T> e) |
|
protected void |
Entry.set(Entry<T> e) |
|
void |
Entry.setToCover(Entry<T> e1,
Entry<T> e2) |
|
<T> org.tinspin.index.rtree.RTreeNode<T> |
RStarTreeLogic.split(org.tinspin.index.rtree.RTreeNode<T> node,
Entry<T> e) |
Choose subtree as described in the paper.
|
<T> org.tinspin.index.rtree.RTreeNode<T> |
RTreeLogic.split(org.tinspin.index.rtree.RTreeNode<T> node,
Entry<T> e) |
|