Abstract

Let D be a set of n pairwise disjoint unit disks in the plane. We describe how to build a data structure for D so that for any point set P containing exactly one point from each disk, we can quickly nd the onion decomposition (convex layers) of P. Our
... read more