From 9b838d3e2cdadb2da31917dbf0fb7c9e203ae9ec Mon Sep 17 00:00:00 2001
From: Ramy-Badr-Ahmed <126559907+Ramy-Badr-Ahmed@users.noreply.github.com>
Date: Fri, 9 Aug 2024 15:37:51 +0200
Subject: [PATCH] Create nearestNeighbourSearch.m

---
 Task/K-d-tree/Matlab/nearestNeighbourSearch.m | 56 +++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 Task/K-d-tree/Matlab/nearestNeighbourSearch.m

diff --git a/Task/K-d-tree/Matlab/nearestNeighbourSearch.m b/Task/K-d-tree/Matlab/nearestNeighbourSearch.m
new file mode 100644
index 0000000000..75ed16d46d
--- /dev/null
+++ b/Task/K-d-tree/Matlab/nearestNeighbourSearch.m
@@ -0,0 +1,56 @@
+function [nearestPoint, nearestDist, nodesVisited] = nearestNeighbourSearch(root, queryPoint)
+    
+    nearestPoint = [];
+    nearestDist = inf;
+    nodesVisited = 0;
+
+    % Define the recursive search function
+    function search(node, depth)
+        if isempty(node)
+            return;
+        end
+
+        nodesVisited = nodesVisited + 1; 
+
+        % Calculate the current distance (squared distance)
+
+        currentPoint = node.point;      
+        currentDist = sum((queryPoint - currentPoint).^2);
+
+        % Update nearest point if the current node is closer
+
+        if isempty(nearestPoint) || currentDist < nearestDist
+            nearestPoint = currentPoint;
+            nearestDist = currentDist;
+        end
+
+        % Determine which subtree to search first (based on axis and query point)
+
+        k = length(queryPoint);    % Dimensionality of points
+        axis = mod(depth, k) + 1;
+
+        if queryPoint(axis) <= currentPoint(axis)
+            nearerSubtree = node.left;
+            furtherSubtree = node.right;
+        else
+            nearerSubtree = node.right;
+            furtherSubtree = node.left;
+        end
+
+        % Search the nearer subtree first
+
+        search(nearerSubtree, depth + 1);
+
+        % If the further subtree has a closer point
+
+        dx = queryPoint(axis) - currentPoint(axis);
+        if dx^2 < nearestDist
+            search(furtherSubtree, depth + 1);
+        end
+    end
+
+    % Search from the root of the kd-tree
+
+    search(root, 0);
+    
+end