Approximate Geometric Queries (using BAR trees), continued

the details behind approximate nearest-neighbor searching and
constructing Balanced Aspect Ratio trees. Although this talk
will probably be more technical than last week, I will try to
keep out the major technical proofs... focusing in particular
on the 2-D construction with a little emphasis on tackling the
problem in higher dimensions (involves a few more "tricks").