{"title":"Kd-Tree\u30e1\u30e2","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fnagakagachi.hatenablog.com%2Fentry%2F2020%2F06%2F18%2F001027\" title=\"Kd-Tree\u30e1\u30e2 - \u306a\u304c\u3080\u3057\u30e1\u30e2\" 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://nagakagachi.hatenablog.com/entry/2020/06/18/001027","height":"190","image_url":null,"categories":[],"version":"1.0","blog_url":"https://nagakagachi.hatenablog.com/","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/nagakagachi/","blog_title":"\u306a\u304c\u3080\u3057\u30e1\u30e2","description":"Stackless Traversal Stack\u3092\u4f7f\u308f\u306a\u3044\u6728\u69cb\u9020\u306e\u8d70\u67fb. Kd-Tree kd-restart https://graphics.stanford.edu/papers/gpu_kdtree/kdtree.pdf \u5b50\u30ce\u30fc\u30c9\u306e\u3046\u3061\u59cb\u70b9\u306b\u8fd1\u3044\u65b9\u306e\u5b50\u3092\u5148\u306b\u51e6\u7406\u3057\u3001leaf\u306b\u5230\u9054\u3057\u3066\u51e6\u7406\u3092\u3057\u305f\u3089 tmin\u3092tmax\u3067\u66f4\u65b0\u3057\u3001tmax\u3092\u65b0\u305f\u306b\u30eb\u30fc\u30c8\u3068\u306e\u4ea4\u5dee\u3067\u66f4\u65b0\u3057\u3066\u304b\u3089\u8d70\u67fb\u3092\u7d9a\u3051\u308b. tmin,tmax\u3060\u3051\u3092\u4fdd\u6301\u3057\u3066\u90fd\u5ea6\u8d70\u67fb\u30ce\u30fc\u30c9\u3092\u691c\u7d22\u3057\u3066\u30ea\u30b9\u30bf\u30fc\u30c8\u3059\u308b. Rope \u6c34\u5e73\u65b9\u5411\u306e\u30ce\u30fc\u30c9\u9593\u306e\u30ea\u30f3\u30af(Rope)\u306b\u3088\u3063\u3066Stackless\u306a\u8d70\u67fb\u3092\u5b9f\u73fe\u3059\u308b. http://www.johanne\u2026","author_name":"nagakagachi","width":"100%","provider_name":"Hatena Blog","type":"rich","published":"2020-06-18 00:10:27"}