public void UpdateTest()
{
var tree = new AABBTree(true);
var node = new AABBExternalNode()
{
Data = 1
};
tree.add(node, new AABBBox(new Point3(1, 1, 1), new Point3(10, 10, 10)));
tree.add(new AABBExternalNode()
{
Data = 2
}, new AABBBox(new Point3(5, 5, 5), new Point3(15, 15, 15)));
tree.finalize();
Assert.Equal(3, tree.getNodes().Count);
tree.update(node, new AABBBox(new Point3(20, 20, 20), new Point3(33, 33, 33)));
tree.finalize();
Assert.Equal(3, tree.getNodes().Count);
var treeNode = tree.getNodes().FirstOrDefault(n => n.externalNode?.spatialIndex == node.spatialIndex);
Assert.NotNull(treeNode);
Assert.Equal(20, treeNode.extents[0]);
Assert.Equal(20, treeNode.extents[1]);
Assert.Equal(20, treeNode.extents[2]);
Assert.Equal(33, treeNode.extents[3]);
Assert.Equal(33, treeNode.extents[4]);
Assert.Equal(33, treeNode.extents[5]);
tree.clear();
Assert.Equal(0, tree.getNodes().Count);
}
public void AddTest()
{
var tree = new AABBTree(true);
tree.add(new AABBExternalNode()
{
Data = 1
}, new AABBBox(new Point3(1, 1, 1), new Point3(10, 10, 10)));
tree.finalize();
Assert.Equal(1, tree.getNodes().Count);
tree.add(new AABBExternalNode()
{
Data = 2
}, new AABBBox(new Point3(5, 5, 5), new Point3(15, 15, 15)));
tree.finalize();
Assert.Equal(3, tree.getNodes().Count);
tree.clear();
Assert.Equal(0, tree.getNodes().Count);
}
static void Main(string[] args)
{
// build tree
var tree = new AABBTree(true);
tree.add(new AABBExternalNode()
{
Data = 1
}, new AABBBox(new Point3(0, 0, 0), new Point3(10, 10, 10)));
tree.add(new AABBExternalNode()
{
Data = 2
}, new AABBBox(new Point3(5, 5, 5), new Point3(15, 15, 15)));
tree.add(new AABBExternalNode()
{
Data = 3
}, new AABBBox(new Point3(20, 20, 20), new Point3(30, 30, 30)));
tree.add(new AABBExternalNode()
{
Data = 4
}, new AABBBox(new Point3(40, 40, 40), new Point3(50, 50, 50)));
var node = new AABBExternalNode()
{
Data = 6
};
tree.add(node, new AABBBox(new Point3(50, 50, 50), new Point3(60, 60, 60)));
var lastNode = new AABBExternalNode()
{
Data = 5
};
tree.add(lastNode, new AABBBox(new Point3(51, 51, 51), new Point3(60, 60, 60)));
tree.finalize();
// remove
tree.remove(node);
tree.update(lastNode, new AABBBox(new Point3(51, 51, 51), new Point3(61, 61, 61)));
tree.finalize();
// get parent
var parent = tree.findParent(lastNode.spatialIndex);
var children = tree.findChildren(1);
// get all the overlapping pairs
List <AABBExternalNode> overlappingNodes = new List <AABBExternalNode>();
var count = tree.getOverlappingPairs(overlappingNodes);
Console.WriteLine($"Node Count:{count}");
overlappingNodes.ForEach(node => node.Print());
overlappingNodes.Clear();
// find overlapping nodes by bounding box
var queryExtents = new AABBBox(new Point3(-40, -40, -40), new Point3(40, 40, 40));
count = tree.getOverlappingNodes(queryExtents, overlappingNodes);
Console.WriteLine($"Node Count:{count}");
overlappingNodes.ForEach(node => node.Print());
overlappingNodes.Clear();
// find overlapping nodes by sphere
count = tree.getSphereOverlappingNodes(new Point3(20, 20, 20), 21, overlappingNodes);
Console.WriteLine($"Node Count:{count}");
overlappingNodes.ForEach(node => node.Print());
overlappingNodes.Clear();
// find nodes by planes
var normal = new Vector3(0, 0, 1);
var plane = new Plane3(normal.X, normal.Y, normal.Z, -20);
count = tree.getVisibleNodes(new Plane3[] { plane }, overlappingNodes);
Console.WriteLine($"Node Count:{count}");
overlappingNodes.ForEach(node => node.Print());
overlappingNodes.Clear();
// TODO: ray test
var ray = new AABBTreeRay()
{
direction = new Vector3(1, 1, 1), origin = new Point3(), maxFactor = 30
};
var testRes = new AABBTreeRayTest().rayTest(new AABBTree[] { tree }, ray);
tree.clear();
}