Posted by: atri | November 16, 2011

Lect 33: Closest Pair of Points

In today’s lecture we saw the O(n\log{n}) time divide and conquer algorithm for computing the closest pair of points among the given n points, except the proof of the kickass property lemma. Next lecture we will complete the proof and start with dynamic programming (Sec 6.1).

The slides and notes for the lecture have been uploaded.

Below are links to the student blog posts for the lecture:

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: