{"author_name":"hanecci","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fhanecci.hatenadiary.org%2Fentry%2F20110503%2F1304450327\" title=\"Hash based data structures for nearest neighbor search - OLD hanecci\u2019s blog : \u65e7 \u306f\u306d\u3063\u3061\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","url":"https://hanecci.hatenadiary.org/entry/20110503/1304450327","width":"100%","blog_title":"OLD hanecci\u2019s blog : \u65e7 \u306f\u306d\u3063\u3061\u30d6\u30ed\u30b0","provider_name":"Hatena Blog","published":"2011-05-03 04:18:47","categories":[],"description":"\u30d5\u30a9\u30c8\u30f3\u30de\u30c3\u30d4\u30f3\u30b0\u3084 SPH\u30fbMPS \u3068\u3044\u3063\u305f\u7c92\u5b50\u6cd5\u3067\u306f, \u7c92\u5b50\u306e\u8fd1\u508d\u63a2\u7d22\u304c\u4f7f\u7528\u3055\u308c\u307e\u3059. \u30d5\u30a9\u30c8\u30f3\u30de\u30c3\u30d4\u30f3\u30b0\u306b\u5bfe\u3057\u3066\u306f K-d \u6728\u3092\u4f7f\u3046\u63d0\u6848\u3082\u3055\u308c\u3066\u3044\u307e\u3059\u304c, \u30cf\u30c3\u30b7\u30e5\u3092\u4f7f\u3063\u305f\u30c7\u30fc\u30bf\u69cb\u9020\u306e\u65b9\u304c\u30af\u30a8\u30ea\u306a\u3069\u304c\u901f\u3044\u3068\u601d\u3044\u307e\u3059. \u3044\u304f\u3064\u304b\u8ad6\u6587\u306e\u30ea\u30f3\u30af\u3092\u6319\u3052\u3066\u304a\u304d\u307e\u3059.Nearest neighbor search is used for photon mapping and particle method like SPH, MPS. Using k-d tree is proposed for photon mapping, but hash based data structure is fas\u2026","version":"1.0","type":"rich","author_url":"https://blog.hatena.ne.jp/hanecci/","image_url":null,"blog_url":"https://hanecci.hatenadiary.org/","height":"190","title":"Hash based data structures for nearest neighbor search","provider_url":"https://hatena.blog"}