algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 06:23:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add QuadTree data structure (#5681)

Browse Source
This commit is contained in:
Sailok Chinta
2024-10-12 12:53:41 +05:30
committed by GitHub
parent e38611e9db
commit e263edcfe0
3 changed files with 235 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

58
src/test/java/com/thealgorithms/datastructures/trees/QuadTreeTest.java Normal file
View File

@ -0,0 +1,58 @@
package com.thealgorithms.datastructures.trees;
import java.util.List;
import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
public class QuadTreeTest {
int quadTreeCapacity = 4;
BoundingBox boundingBox = new BoundingBox(new Point(0, 0), 500);
QuadTree quadTree = new QuadTree(boundingBox, quadTreeCapacity);
@Test
public void testNullPointInsertIntoQuadTree() {
Assertions.assertFalse(quadTree.insert(null));
}
@Test
public void testInsertIntoQuadTree() {
Assertions.assertTrue(quadTree.insert(new Point(10, -10)));
Assertions.assertTrue(quadTree.insert(new Point(-10, 10)));
Assertions.assertTrue(quadTree.insert(new Point(-10, -10)));
Assertions.assertTrue(quadTree.insert(new Point(10, 10)));
Assertions.assertFalse(quadTree.insert(new Point(1050, 1050)));
}
@Test
public void testInsertIntoQuadTreeAndSubDivide() {
Assertions.assertTrue(quadTree.insert(new Point(10, -10)));
Assertions.assertTrue(quadTree.insert(new Point(-10, 10)));
Assertions.assertTrue(quadTree.insert(new Point(-10, -10)));
Assertions.assertTrue(quadTree.insert(new Point(10, 10)));
Assertions.assertTrue(quadTree.insert(new Point(-100, 100)));
Assertions.assertTrue(quadTree.insert(new Point(100, -101)));
Assertions.assertTrue(quadTree.insert(new Point(-100, -100)));
Assertions.assertTrue(quadTree.insert(new Point(100, 100)));
}
@Test
public void testQueryInQuadTree() {
quadTree.insert(new Point(10, -10));
quadTree.insert(new Point(-10, 10));
quadTree.insert(new Point(-10, -10));
quadTree.insert(new Point(10, 10));
quadTree.insert(new Point(-100, 100));
quadTree.insert(new Point(100, -100));
quadTree.insert(new Point(-100, -100));
quadTree.insert(new Point(100, 100));
List<Point> points = quadTree.query(new BoundingBox(new Point(0, 0), 100));
Assertions.assertEquals(8, points.size());
points = quadTree.query(new BoundingBox(new Point(5, 5), 5));
Assertions.assertEquals(1, points.size());
points = quadTree.query(new BoundingBox(new Point(-200, -200), 5));
Assertions.assertEquals(0, points.size());
}
}