一种有效的实现分裂合并算法的数据结构

An Efficient Data Structure for Realizing SplitandMerge Method

针对现有分裂合并分割算法数据结构存在的问题，本文设计了一种新的数据结构。这种数据结构能非常方便地实现分裂合并算法的每一步骤以及动态地分配内存，从而显著地减少了计算时间并在内存需求上有一定的改善。实验结果表明用这种数据结构实现分裂合并分割算法是有效的。

An efficient data structure for realizing spiltandmerge image segmentation method is devised in order to overcome the problems in the current methods. This data structure can very easily realizes each step in the idea of splitandmerge and dynamically assigns memory, it results in a remarkable decrease in computational time and an improvement in memory space. The experimental results show that this method developed is very efficient in realizing splitandmerge.