public bool Intersects(Bounds b)
{
if (values == null)
{
if (split <= b.max[splittingAxis])
{
if (left.Intersects(b))
{
return(true);
}
}
if (split >= b.min[splittingAxis])
{
if (right.Intersects(b))
{
return(true);
}
}
}
else
{
foreach (KDTreeValue v in values)
{
if (v.b.Intersects(b))
{
return(true);
}
}
}
return(false);
}
public bool Intersects(Bounds b)
{
if (node == null)
{
return(false);
}
return(node.Intersects(b));
}