An Adaptive Parallel Method for Indexing Transportation Moving Objects

Algorithm 3

Cell division split.

	Input: quad-tree leaf node
	Output: no output; quad-tree structure changes after the operation
(1)	x_middle = (left + right)/2;
(2)	y_middle = /2;
(3)	s_node.children[0] = new QuadTree (x_middle, right, y_middle, ceiling; /∗ in a similar way to initialize s_node.children [1–3] ∗/
(4)	for each (child in s_node.children)
	child.parent = s_node;
	s_node.p_bucket. ;
(5)	if (s_node.parent in split_candidates)
	delete_from_split_candidates (s_node.parent);
(6)	insert_split_candidates (s_node);