Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
K
L
M
N
P
R
S
T
U
W
F
fillDistances(Map<LocalAbstractObject, List<Split.Edge>>, LocalAbstractObject)
- Static method in class mtree.utils.
Split
Fills the distances between pivot p and other objects of a given component (the component is determined by pivot p).
filterApproxNodeEntry(NodeEntry, float, LocalAbstractObject, float, float)
- Static method in class mtree.utils.
Search
Decides whether the specified node entry could be filtered.
filterNodeEntry(NodeEntry, float, LocalAbstractObject, float, float)
- Static method in class mtree.utils.
Search
Decides whether the specified node entry could be filtered.
filterNodeEntryUsingPivots(NodeEntry, LocalAbstractObject, float)
- Static method in class mtree.utils.
Search
Decides whether the specified node entry could be filtered in the sense of filtering using HR array.
finalize()
- Method in class mtree.
MTree
findAllObjectsInComponent(Map<LocalAbstractObject, List<Split.Edge>>, LocalAbstractObject)
- Static method in class mtree.utils.
Split
Returns a list of objects which belong to one component (component is determined by object o).
findBestSpanEdge(Map<LocalAbstractObject, List<Split.Edge>>, Set<Split.Edge>)
- Static method in class mtree.utils.
Split
Returns an edge which is the most convenient to divide the spanning tree into 2 components.
findLastInternalNodes(Node)
- Static method in class mtree.utils.
Search
Looks for all internal nodes with node level 1 (descendants are leaves).
findLeavesByQuery(Node, LocalAbstractObject, float)
- Static method in class mtree.utils.
Search
Looks for all leaves which are incident to the region R(q, r).
findLeavesByQuery(Node, LocalAbstractObject, float, Map<LocalAbstractObject, Float>)
- Static method in class mtree.utils.
Search
Looks for all leaves which are incident to the region R(q, r).
findNearestLeafList(LocalAbstractObject, Node)
- Static method in class mtree.utils.
Insert
Returns a leaf which is the most convenient for inserting new object.
findPivot(Map<LocalAbstractObject, List<Split.Edge>>, List<LocalAbstractObject>)
- Static method in class mtree.utils.
Split
Looks for a pivot (the most convenient object) from the list of objects objectList.
formsOneComponent(Map<LocalAbstractObject, List<Split.Edge>>, LocalAbstractObject, LocalAbstractObject)
- Static method in class mtree.utils.
Split
Decides whether objects o1 and o2 belong to one component determined by edges stored in objectMap.
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV LETTER
NEXT LETTER
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
K
L
M
N
P
R
S
T
U
W