在上一节中我们讲解了KD的构造过程,这里我们主要讲解的KD的搜索过程,如何查找距离目标点最近的点。
我们先把KD树的最邻近搜索(KNN)的代码粘贴出来:
private Node KDTreeFindNearest(Node tree, Train target)
{
double dist = double.MaxValue; //最近邻和目标点之间的距离
Node nearest = null; //最近邻节点
Node searchNode = tree; //根节点
List<Node> searchPath = new List<Node>(); //搜索路径
#region 检索搜索路径
while (searchNode != null)
{
searchPath.Add(searchNode); //添加当前搜索节点
if (searchNode.split == 0)
{
//X方向轴分割
if (target.positionX <= searchNode.point.positionX)
{
searchNode = searchNode.leftNode;
}
else
searchNode = searchNode.righNode;
}
else if (searchNode.split == 1)
{
//Y方向轴分割
if (target.positionY <= searchNode.point.positionY)
{
searchNode = searchNode.leftNode;
}
else
searchNode = searchNode.righNode;
}
else
{
if (target.positionZ <= searchNode.point.positionZ)
{
searchNode = searchNode.leftNode;
}
else
searchNode = searchNode.righNode;
}
}
#endregion
nearest = searchPath[searchPath.Count - 1]; //获取搜索路径最后一个节点
searchPath.Remove(nearest); //从搜索路径中删除假定的最近邻节点
//计算两个节点之间的距离
dist = this.Distance(nearest.point, target);
#region 回溯路径搜索
Node backNode;
int split = -1;
while (searchPath.Count > 0)
{
backNode = searchPath[searchPath.Count - 1]; //取搜索路径最后一个
if (backNode.leftNode == null && backNode.righNode == null)
{
//该节点为叶子节点
if (Distance(nearest.point, target) > Distance(backNode.point, target))
{
nearest = backNode;
dist = Distance(backNode.point, target);
}
}
else
{
split = backNode.split; //取出当前的分割方向轴
if (split == 0)
{
if (Distance(backNode.point, target) < dist)
{
nearest = backNode;
dist = Distance(backNode.point, target);
}
//确定是否进入子空间搜索
float disTmp = Math.Abs(target.positionX - backNode.point.positionX);
if (disTmp < dist)
{
//判断目标点是在左子空间还是右子空间
if (target.positionX > backNode.point.positionX)
{
//目标点在右子空间,则需要进入左子空间进行搜索
searchNode = backNode.leftNode;
}
else
searchNode = backNode.righNode;
searchPath.Add(searchNode); //添加搜索节点
}
}
else if (split == 1)
{
if (Distance(backNode.point, target) < dist)
{
nearest = backNode;
dist = Distance(backNode.point, target);
}
//确定是否进入子空间搜索
float disTmp = Math.Abs(target.positionY - backNode.point.positionY);
if (disTmp < dist)
{
//判断目标点是在左子空间还是右子空间
if (target.positionY > backNode.point.positionY)
{
//目标点在右子空间,则需要进入左子空间进行搜索
searchNode = backNode.leftNode;
}
else
searchNode = backNode.righNode;
searchPath.Add(searchNode); //添加搜索节点
}
}
else
{
if (Distance(backNode.point, target) < dist)
{
nearest = backNode;
dist = Distance(backNode.point, target);
}
//确定是否进入子空间搜索
float disTmp = Math.Abs(target.positionZ - backNode.point.positionZ);
if (disTmp < dist)
{
//判断目标点是在左子空间还是右子空间
if (target.positionZ > backNode.point.positionZ)
{
//目标点在右子空间,则需要进入左子空间进行搜索
searchNode = backNode.leftNode;
}
else
searchNode = backNode.righNode;
searchPath.Add(searchNode); //添加搜索节点
}
}
}
searchPath.Remove(backNode);
}
#endregion
return nearest; //返回最近邻节点
}
下面我们讲解一下搜索过程。
首先,我们从根节点开始搜索,一直搜索到目标点所在区域的叶子节点,同时假定叶子节点时距离目标点最近的节点,计算他们之间的欧几里德距离,并且假定这个距离值最近的距离。即:
double dist = double.MaxValue; //最近邻和目标点之间的距离
Node nearest = null; //最近邻节点
Node searchNode = tree; //根节点
List<Node> searchPath = new List<Node>(); //搜索路径
#region 检索搜索路径
while (searchNode != null)
{
searchPath.Add(searchNode); //添加当前搜索节点
if (searchNode.split == 0)
{
//X方向轴分割
if (target.positionX <= searchNode.point.positionX)
{
searchNode = searchNode.leftNode;
}
else
searchNode = searchNode.righNode;
}
else if (searchNode.split == 1)
{
//Y方向轴分割
if (target.positionY <= searchNode.point.positionY)
{
searchNode = searchNode.leftNode;
}
else
searchNode = searchNode.righNode;
}
else
{
if (target.positionZ <= searchNode.point.positionZ)
{
searchNode = searchNode.leftNode;
}
else
searchNode = searchNode.righNode;
}
}
#endregion
nearest = searchPath[searchPath.Count - 1]; //获取搜索路径最后一个节点
searchPath.Remove(nearest); //从搜索路径中删除假定的最近邻节点
//计算两个节点之间的距离
dist = this.Distance(nearest.point, target);
其次,当搜索到叶子节点的时候,搜索路径已经确定,然后我们需要进行回溯查找,一直到搜索路径为空的时候,那么就结束搜索,返回搜索到的最近邻节点。当然在回溯查找的过程中,我们也是搜索到子树的叶子节点问题。
#region 回溯路径搜索
Node backNode;
int split = -1;
while (searchPath.Count > 0)
{
backNode = searchPath[searchPath.Count - 1]; //取搜索路径最后一个
if (backNode.leftNode == null && backNode.righNode == null)
{
//该节点为叶子节点
if (Distance(nearest.point, target) > Distance(backNode.point, target))
{
nearest = backNode;
dist = Distance(backNode.point, target);
}
}
else
{
split = backNode.split; //取出当前的分割方向轴
if (split == 0)
{
if (Distance(backNode.point, target) < dist)
{
nearest = backNode;
dist = Distance(backNode.point, target);
}
//确定是否进入子空间搜索
float disTmp = Math.Abs(target.positionX - backNode.point.positionX);
if (disTmp < dist)
{
//判断目标点是在左子空间还是右子空间
if (target.positionX > backNode.point.positionX)
{
//目标点在右子空间,则需要进入左子空间进行搜索
searchNode = backNode.leftNode;
}
else
searchNode = backNode.righNode;
searchPath.Add(searchNode); //添加搜索节点
}
}
else if (split == 1)
{
if (Distance(backNode.point, target) < dist)
{
nearest = backNode;
dist = Distance(backNode.point, target);
}
//确定是否进入子空间搜索
float disTmp = Math.Abs(target.positionY - backNode.point.positionY);
if (disTmp < dist)
{
//判断目标点是在左子空间还是右子空间
if (target.positionY > backNode.point.positionY)
{
//目标点在右子空间,则需要进入左子空间进行搜索
searchNode = backNode.leftNode;
}
else
searchNode = backNode.righNode;
searchPath.Add(searchNode); //添加搜索节点
}
}
else
{
if (Distance(backNode.point, target) < dist)
{
nearest = backNode;
dist = Distance(backNode.point, target);
}
//确定是否进入子空间搜索
float disTmp = Math.Abs(target.positionZ - backNode.point.positionZ);
if (disTmp < dist)
{
//判断目标点是在左子空间还是右子空间
if (target.positionZ > backNode.point.positionZ)
{
//目标点在右子空间,则需要进入左子空间进行搜索
searchNode = backNode.leftNode;
}
else
searchNode = backNode.righNode;
searchPath.Add(searchNode); //添加搜索节点
}
}
}
searchPath.Remove(backNode);
}
#endregion
代码下载