Detecting Duplicates Among Similar Bit Vectors of course, with geometric applications

We show how to detect duplicates in a sequence of k n-bit vectors presented as a list of single-bit changes between consecutive vectors, in O((n+k)logn) time. An application of this result to a computational problem in arrangements of geometric shapes is presented as well.