Karlsson, R. G. (1986). Greedy Matching on a Grid. Technical Report LiTH-IDA-R-86-25, Department of Computer and Information Science, Linköping University, Sweden. Also in BIT. (bibtex),
Abstract: A fast solution to the complete minimum matching problem using a greedy heuristic is presented, when the points are distributed on a grid domain. For this a data structure which efficiently supports nearest neighbor searches and deletions is developed.
CS Dept TR Overview