... proximity problems include CLOSEST-PAIR, ALLNEAREST-NEIGHBORS, EUCLIDEAN-MINIMUM-SPANNING-TREE, TRIANGULATION, and MAXIMUM-EMPTY-CIRCLE Proximity problems arise in many applications where physical ... one-to-one correspondence between the edges of G and edge nodes in the corresponding DCEL An edge node consists of four information elds V V F and F 2, and two pointer elds P and P The elds V and ... same time as the rst ACM Symposium on Computational Geometry was held, and just prior to the start of a new Springer-Verlag journal Discrete and Computational Geometry The eld is currently thriving...