Memory Management for Union-Find Algorithms

摘要

We provide a general tool to improve the real time performance of a broad class of Union-Find algorithms. This is done by minimizing the random access memmory that is used and thus to avoid the well-known von Neumann bottleneck of synchronizing CPU and memory. A main application to image segmentation algorithms is demonstrated where the real time performance is drastically improved.