503_HW3_Example

503_HW3_Example - UML CS Analysis of Algorithms 91.503...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Analysis of Algorithms 91.503 (section 201) Spring, 2011 page 1 of 4 Example for Homework #3 Closest Pairs : This problem uses the journal paper “ Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs by David Eppstein. Start with an initial set of 7 points: {(1, 5), (2,8), (3,0), (4,5), (5,7), (6,2), (7,6)}. Insert point (0,3). Delete point (4,5). Insert point (3,1). After initialization and after each insertion and deletion: - show all subsets S i and, for each, G i and Φ i - calculate Φ . Make the following assumptions: - Distance between 2 points (a x , a y ) and (b x , b y ) is calculated using the Manhattan formula: |a x - b x | + |a y - b y |. - All logarithms use base 2. - G i construction starts with the leftmost point in S i (ties are resolved in favor of the higher point). - When performing a delete operation, y is removed from its subset. Initial Distance Matrix
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/13/2012 for the course CS 91.503 taught by Professor Staff during the Spring '11 term at UMass Lowell.

Page1 / 4

503_HW3_Example - UML CS Analysis of Algorithms 91.503...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online