Posted by: atri | November 26, 2012

## Lect 34: Kickass Property Lemma

In today’s lecture we proved the kickass property lemma, which completed the $O(n\log{n})$ time algorithm to compute the closest pair of points among given $n$ points in the plane.

The slides and notes have been uploaded.