|
|
|||||||||||||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||||||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectde.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.TopologicalSplit<E>
class TopologicalSplit<E extends SpatialEntry>
Encapsulates the required parameters for a topological split of a R*-Tree.
Field Summary | |
---|---|
private int |
bestSorting
Indicates whether the sorting according to maximal or to minimal value has been used for choosing the split axis and split point. |
private List<E> |
maxSorting
The entries sorted according to their max values of their MBRs. |
private List<E> |
minSorting
The entries sorted according to their min values of their MBRs. |
private int |
splitAxis
The split axis. |
private int |
splitPoint
The index of the split point. |
Constructor Summary | |
---|---|
TopologicalSplit(List<E> entries,
int minEntries)
Creates a new Split object. |
Method Summary | |
---|---|
private void |
chooseSplitAxis(List<E> entries,
int minEntries)
Chooses a split axis. |
private void |
chooseSplitPoint(int minEntries)
Chooses a split axis. |
int |
getBestSorting()
Returns whether the sorting according to maximal or to minimal value has been used for choosing the split axis and split point. |
List<E> |
getMaxSorting()
Returns the entries to be splitted sorted according to their max values of their MBRs. |
List<E> |
getMinSorting()
Returns the entries to be splitted sorted according to their min values of their MBRs. |
int |
getSplitAxis()
Returns the split axis. |
int |
getSplitPoint()
Returns the split point. |
private HyperBoundingBox |
mbr(List<E> entries,
int from,
int to)
Computes and returns the mbr of the specified nodes, only the nodes between from and to index are considered. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
private int splitAxis
private int splitPoint
private int bestSorting
private List<E extends SpatialEntry> maxSorting
private List<E extends SpatialEntry> minSorting
Constructor Detail |
---|
public TopologicalSplit(List<E> entries, int minEntries)
entries
- the entries to be splitminEntries
- number of minimum entries in the node to be splitMethod Detail |
---|
public int getSplitAxis()
public int getSplitPoint()
public List<E> getMaxSorting()
public List<E> getMinSorting()
public int getBestSorting()
private void chooseSplitAxis(List<E> entries, int minEntries)
entries
- the entries to be splitminEntries
- number of minimum entries in the node to be splitprivate void chooseSplitPoint(int minEntries)
minEntries
- number of minimum entries in the node to be splitprivate HyperBoundingBox mbr(List<E> entries, int from, int to)
entries
- the array of nodesfrom
- the start indexto
- the end index
|
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |