From 536834779a093c6d4736102a7642b42c29459565 Mon Sep 17 00:00:00 2001 From: Florian Amsallem Date: Sun, 4 Aug 2024 17:20:18 +0200 Subject: [PATCH] kdtree article: fix link to article --- content/articles/kdtree/kdtree.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/articles/kdtree/kdtree.rst b/content/articles/kdtree/kdtree.rst index e979673..ae15551 100644 --- a/content/articles/kdtree/kdtree.rst +++ b/content/articles/kdtree/kdtree.rst @@ -7,7 +7,7 @@ arbitrary and should not disturb a *non-rustacean* (who doesn't code in rust) re The implementation I will use is described in the scientific paper `On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) -`_. +`_. Since this paper describes well the theoretical part, I will focus on the implementation. However, if you just want to implement a KD tree without diving into the paper formulas, you can keep reading without woring.