{"author_name":"gregory-igehy","categories":[],"description":"URL Lecture 13+ : Nearest Neighbor Search http://andrewd.ces.clemson.edu/courses/cpsc805/references/nearest_search.pdf K-D trees CSE 373. Data Structures. Lecture22. https://courses.cs.washington.edu/courses/cse373/02au/lectures/lecture22l.pdf \"Computational Geometry\" Lecture 6: Kd-trees and range t\u2026","provider_name":"Hatena Blog","published":"2015-03-11 13:21:33","type":"rich","blog_url":"https://gregory-igehy.hatenadiary.com/","image_url":"http://cdn-ak.f.st-hatena.com/images/fotolife/g/gregory-igehy/20150311/20150311132054.jpg","title":"Notes of kd-tree","url":"https://gregory-igehy.hatenadiary.com/entry/2015/03/11/132133","author_url":"https://blog.hatena.ne.jp/gregory-igehy/","height":"190","width":"100%","blog_title":"Gregory Igehy","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fgregory-igehy.hatenadiary.com%2Fentry%2F2015%2F03%2F11%2F132133\" title=\"Notes of kd-tree - Gregory Igehy\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_url":"https://hatena.blog","version":"1.0"}