An Adaptive Parallel Method for Indexing Transportation Moving Objects

Algorithm 4

Cell merge .

	Input: quad-tree node: m_ =
	Output: no output; quad-tree structure changes after the operation
(1)	if(for each m_node, children is_leaf()) /∗all children with the node m_node are leaf nodes∗/
(2)	m_node.p_bucket ← ;
(3)	delete _null_bucket (m_node.p_bucket);
(4)	if (m_node in merge_candidates)
(5)	delete _from_merge_candidates (m_node)
(6)	if (for each m_node.parent.child is_leaf())
(7)	insert _merg_candidates (m_node.parent);