1. Bin Yao, Feifei Li, Piyush Kumar Presenter: Lian Liu

2.  Min, Max, Minmax Distance Definition

5.  Range query with R-trees:

6.  Distance Priority Algorithm

7.  Depth Priority Algorithm

8.  Dudley’s Approximate Convex Hull  Intuition: If the convex hull contains too many points to fit into memory, we just select some of these points to approximate the CH.  These points are carefully selected, such that the approximate CH is very ‘similar’ to the original CH.

9.  Dudley’s Approximate Convex Hull  In geometry, we use a variable ε (called Hausdorff distance) to measure how `similar’ the approximate CH is to the actual CH.  The smaller ε is, the more accurate the approximate CH is. However it also contains more points (i.e. O(1/ ε (d-1)/2 ) points), thus needs more memory.

10.  monochromatic  adj. 单色的  bichromatic  adj. 二色性的 ( 双色的 )  convex hull  n. 凸包  bisector  n. 垂直平分线