k-d tree
摘要：
k-d tree Given a list of n points, the following algorithm will construct a balanced kd-tree containing those points.function kdtree (list of points pointList, int depth) { if pointList is empty ... 阅读全文
posted @ 2008-08-02 16:18 cutepig 阅读(1464) 评论(1) 推荐(0) 编辑
