Computing the Hausdorff set distance in linear time for any \(L_ p\) point distance (Q811140)

The author considers a finite integral lattice X on \({\mathbb{R}}^ 2\) consisting of R rows and C columns (thus modelling a grid of RC pixels). He presents a program that computes the Hausdorff distance between two subsets A,B\(\subset X\) where X is endowed with the \(\ell^ p\)-metric (1\(\leq p\leq \infty)\). The algorithm is linear in the number RC of pixels. It is designed in such a way that it generalizes from planar to higher dimensional arrays.