Algorithms for Proximity Problems on Colored Point Sets. - Klaus H. Hinrichs; Thorsten Graf 002 (CCCG, 1993)

A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects. - Thorsten Graf 002; Klaus H. Hinrichs (WADS, 1993)

The Colored Quadrant Priority Search Tree with an Application to the all-nearest-foreign-neighbors Problem. - Andreas Brinkman; Thorsten Graf 002; Klaus H. Hinrichs (CCCG, 1994)

Distribution Algorithms for the all-nearest-foreign-neighbors Problem in Arbitrary Lt-metrics. - Thorsten Graf 002; Klaus H. Hinrichs (CCCG, 1994)

Plane-sweep construction of proximity graphs. - Thorsten Graf 002 (1994)