I/O-efficient batched union-find and its applications to terrain analysis

@inproceedings{Agarwal2006IOefficientBU,
  title={I/O-efficient batched union-find and its applications to terrain analysis},
  author={Pankaj K. Agarwal and Lars Arge and Ke Yi},
  booktitle={Symposium on Computational Geometry},
  year={2006}
}
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-efficient algorithm for the batched (off-line) version of the union-find problem. Given any sequence of N union and find operations, where each union operation joins two distinct sets… CONTINUE READING