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.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: