private TAxis chooseSplitAxis(int nodeFather, int nodeChild)
{
//Console.WriteLine("chooseSplitAxis work");
int[] arr_node;
int i, j, k, idx;
TRNode node_1, node_2;
double perimetr, perimetr_min;
TAxis result = new TAxis();
arr_node = new int[MAX_M + 1];
for (i = 0; i < FNodeArr[nodeFather].FChildren.Length; i++)
{
arr_node[i] = FNodeArr[nodeFather].FChildren[i];
}
arr_node[arr_node.Length - 1] = nodeChild;
perimetr_min = double.MaxValue;
node_1 = new TRNode();
node_2 = new TRNode();
for (i = 0; i <= 1; i++)
{
perimetr = 0;
for (j = 0; j <= 1; j++)
{
node_1.clearChildren();
node_2.clearChildren();
QuickSort(arr_node, 0, arr_node.Length - 1, (TAxis)i, (TBound)j);
for (k = 1; k <= MAX_M - MIN_M * 2 + 2; k++)
{
idx = 0;
while (idx < ((MIN_M - 1) + k))
{
node_1.setChild(idx, arr_node[idx]);
idx++;
}
for (; idx < arr_node.Length; idx++)
{
node_2.setChild(idx - ((MIN_M - 1) + k), arr_node[idx]);
}
updateMBR(node_1);
updateMBR(node_2);
perimetr = perimetr + node_1.margin() + node_2.margin();
}
}
if (perimetr <= perimetr_min)
{
result = (TAxis)i;
perimetr_min = perimetr;
}
perimetr = 0;
}
node_1 = null;
node_2 = null;
arr_node = new int[0];
return(result);
}
/// <summary>
/// разделяет узел на 2 в соответствии с алгоритмами R*-tree splited_Node_Id = ссылка на узел для разделения, inserted_Node_Id = узел для вставки
/// </summary>
/// <param name="splited_Node_Id"></param>
/// <param name="inserted_Node_Id"></param>
#region
private void splitNodeRStar(int splited_Node_Id, int inserted_Node_Id)
{
//Console.WriteLine("splitNodeRSter2 work");
TAxis axe;
int parent_id, new_child_id;
TRNode node_1, node_2, node_1_min, node_2_min;
int i, j, k;
int[] arr_node;
double area_min, Area;
if (FNodeArr[splited_Node_Id].isLeaf)
{
return;
}
if (isRoot(splited_Node_Id))
{
parent_id = newNode();
FNodeArr[FRoot].Parent = parent_id;
FNodeArr[parent_id].setChild(0, FRoot);
FNodeArr[parent_id].Level = FNodeArr[FNodeArr[parent_id].getChild(0)].Level + 1;
FRoot = parent_id;
FNodeArr[parent_id].FisLeaf = false;
FHeight = FHeight + 1;
}
else
{
parent_id = newNode();
FNodeArr[parent_id].Parent = FNodeArr[splited_Node_Id].Parent;
FNodeArr[FNodeArr[parent_id].Parent].setChild(FNodeArr[FNodeArr[parent_id].Parent].FChildren.Length, parent_id);
FNodeArr[splited_Node_Id].Parent = parent_id;
FNodeArr[parent_id].setChild(0, splited_Node_Id);
//parent_id = FNodeArr[splited_Node_Id].Parent;
}
arr_node = new int[MAX_M + 1];
for (i = 0; i < arr_node.Length - 1; i++)
{
arr_node[i] = FNodeArr[splited_Node_Id].getChild(i);
}
arr_node[arr_node.Length - 1] = inserted_Node_Id;
node_1_min = new TRNode();
node_2_min = new TRNode();
node_1 = new TRNode();
node_2 = new TRNode();
axe = chooseSplitAxis(splited_Node_Id, inserted_Node_Id);
area_min = double.MaxValue;
for (i = 0; i <= 1; i++)
{
QuickSort(arr_node, 0, arr_node.Length - 1, axe, (TBound)i);
for (k = MIN_M - 1; k <= MAX_M - MIN_M; k++)
{
node_1.clearChildren();
node_2.clearChildren();
j = 0;
while (j <= k)
{
node_1.setChild(j, arr_node[j]);
j++;
}
for (j = k; j < arr_node.Length - 1; j++)
{
node_2.setChild(j - k, arr_node[j + 1]);
}
updateMBR(node_1);
updateMBR(node_2);
Area = node_1.Area() + node_2.Area();
if (Area < area_min)
{
node_1_min.copy(node_1);
node_2_min.copy(node_2);
area_min = Area;
}
}
}
node_1_min.Level = FNodeArr[splited_Node_Id].Level;
node_2_min.Level = FNodeArr[splited_Node_Id].Level;
FNodeArr[splited_Node_Id].copy(node_1_min);
FNodeArr[splited_Node_Id].Parent = parent_id;
new_child_id = newNode();
FNodeArr[new_child_id].copy(node_2_min);
FNodeArr[new_child_id].Parent = parent_id;
node_1 = null;
node_2 = null;
node_1_min = null;
node_2_min = null;
for (i = 0; i < FNodeArr[new_child_id].FChildren.Length; i++)
{
FNodeArr[FNodeArr[new_child_id].getChild(i)].Parent = new_child_id;
}
if (FNodeArr[parent_id].FChildren.Length < MAX_M)
{
FNodeArr[parent_id].setChild(FNodeArr[parent_id].FChildren.Length, new_child_id);
FNodeArr[parent_id].FisLeaf = false;
updateMBR(parent_id);
}
else
{
splitNodeRStar(parent_id, new_child_id);
}
}
