public void Insert(KDTreeValue val, Bounds b)
{
if (values == null)
{
if (split <= b.max[splittingAxis])
{
left.Insert(val, b);
}
if (split >= b.min[splittingAxis])
{
right.Insert(val, b);
}
}
else
{
values.Add(val);
}
}
public void Insert(T face, Bounds b)
{
if (values == null)
{
if (b.max[splittingAxis] <= split)
{
left.Insert(face, b);
}
if (b.min[splittingAxis] >= split)
{
right.Insert(face, b);
}
}
else
{
values.Add(face);
}
}
public void Insert(T obj, Bounds b)
{
KDTreeValue v = new KDTreeValue(obj, b);
node.Insert(v, b);
}
public void Insert(T obj, Bounds b)
{
node.Insert(obj, b);
}