@Test public void testGetElementsIntersectingLineSegment() { rootQuad.add(point1); rootQuad.add(point2); rootQuad.add(point3); rootQuad.add(point4); Array<CollisionPoint> collisionPoints = rootQuad .getElementsIntersectingLineSegment(new LineSegment(0, 0, 128, 128)); Assert.assertEquals(true, collisionPoints.contains(point1, false)); Assert.assertEquals(false, collisionPoints.contains(point2, false)); Assert.assertEquals(false, collisionPoints.contains(point3, false)); Assert.assertEquals(true, collisionPoints.contains(point4, false)); }
public Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment) { Array<T> result = new Array<T>(); getElementsIntersectingLineSegment(result, lineSegment); return result; }
ConcurrentPointQuadTree extends Rectangle implements QuadTree<T> { public Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment) { Array<T> result = new Array<T>(); getElementsIntersectingLineSegment(result, lineSegment); return result; } }
ConcurrentPointQuadTree extends Rectangle implements QuadTree<T> { public Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment) { Array<T> result = new Array<T>(); getElementsIntersectingLineSegment(result, lineSegment); return result; } ConcurrentPointQuadTree(int elementLimitPerQuad, float x, float y, float width, float height);  ConcurrentPointQuadTree(ConcurrentPointQuadTree<T> parent, float x, float y, float width, float height);  ConcurrentPointQuadTree(int elementLimitPerQuad, int mergeWatermark, float x, float y, float width,
			float height);  ConcurrentPointQuadTree(float minimumQuadWidth, float minimumQuadHeight, int elementLimitPerQuad,
			int mergeWatermark, float x, float y, float width, float height); }
ConcurrentPointQuadTree extends Rectangle implements QuadTree<T> { public Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment) { Array<T> result = new Array<T>(); getElementsIntersectingLineSegment(result, lineSegment); return result; } ConcurrentPointQuadTree(int elementLimitPerQuad, float x, float y, float width, float height);  ConcurrentPointQuadTree(ConcurrentPointQuadTree<T> parent, float x, float y, float width, float height);  ConcurrentPointQuadTree(int elementLimitPerQuad, int mergeWatermark, float x, float y, float width,
			float height);  ConcurrentPointQuadTree(float minimumQuadWidth, float minimumQuadHeight, int elementLimitPerQuad,
			int mergeWatermark, float x, float y, float width, float height); void debugRender(Graphics g); void addAll(Array<T> elementsToAdd); boolean add(T element); void removeAll(Array<T> elementsToRemove); @Override void clear(); boolean remove(T element); @Override Array<T> getElementsWithinArea(Shape area); @Override Array<T> getElementsWithinArea(Shape area, QuadTreeSearchDirection searchDirection); @Override void getElementsWithinArea(Array<T> result, Shape area); @Override void getElementsWithinArea(Array<T> result, Shape area, QuadTreeSearchDirection searchDirection); @Override Array<T> getElementsContainingArea(Shape area, boolean entirelyContained); @Override Array<T> getElementsContainingArea(Shape area, QuadTreeSearchDirection searchDirection, boolean entirelyContained); @Override void getElementsContainingArea(Array<T> result, Shape area, boolean entirelyContained); @Override void getElementsContainingArea(Array<T> result, Shape area, QuadTreeSearchDirection searchDirection, boolean entirelyContained); @Override Array<T> getElementsContainingPoint(Point point); @Override Array<T> getElementsContainingPoint(Point point, QuadTreeSearchDirection searchDirection); @Override void getElementsContainingPoint(Array<T> result, Point point); @Override void getElementsContainingPoint(Array<T> result, Point point, QuadTreeSearchDirection searchDirection); Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment); @Override Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment, QuadTreeSearchDirection searchDirection); void getElementsIntersectingLineSegment(Array<T> result, LineSegment lineSegment); @Override void getElementsIntersectingLineSegment(Array<T> result, LineSegment lineSegment, QuadTreeSearchDirection searchDirection); Array<T> getElements(); void getElements(Array<T> result); int getTotalQuads(); int getTotalElements(); @Override void positionChanged(T moved); QuadTree<T> getParent(); int getTotalMergeOperations(); int getElementLimitPerQuad(); int getMergeWatermark(); @Override float getMinimumQuadWidth(); @Override float getMinimumQuadHeight(); }
ConcurrentPointQuadTree extends Rectangle implements QuadTree<T> { public Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment) { Array<T> result = new Array<T>(); getElementsIntersectingLineSegment(result, lineSegment); return result; } ConcurrentPointQuadTree(int elementLimitPerQuad, float x, float y, float width, float height);  ConcurrentPointQuadTree(ConcurrentPointQuadTree<T> parent, float x, float y, float width, float height);  ConcurrentPointQuadTree(int elementLimitPerQuad, int mergeWatermark, float x, float y, float width,
			float height);  ConcurrentPointQuadTree(float minimumQuadWidth, float minimumQuadHeight, int elementLimitPerQuad,
			int mergeWatermark, float x, float y, float width, float height); void debugRender(Graphics g); void addAll(Array<T> elementsToAdd); boolean add(T element); void removeAll(Array<T> elementsToRemove); @Override void clear(); boolean remove(T element); @Override Array<T> getElementsWithinArea(Shape area); @Override Array<T> getElementsWithinArea(Shape area, QuadTreeSearchDirection searchDirection); @Override void getElementsWithinArea(Array<T> result, Shape area); @Override void getElementsWithinArea(Array<T> result, Shape area, QuadTreeSearchDirection searchDirection); @Override Array<T> getElementsContainingArea(Shape area, boolean entirelyContained); @Override Array<T> getElementsContainingArea(Shape area, QuadTreeSearchDirection searchDirection, boolean entirelyContained); @Override void getElementsContainingArea(Array<T> result, Shape area, boolean entirelyContained); @Override void getElementsContainingArea(Array<T> result, Shape area, QuadTreeSearchDirection searchDirection, boolean entirelyContained); @Override Array<T> getElementsContainingPoint(Point point); @Override Array<T> getElementsContainingPoint(Point point, QuadTreeSearchDirection searchDirection); @Override void getElementsContainingPoint(Array<T> result, Point point); @Override void getElementsContainingPoint(Array<T> result, Point point, QuadTreeSearchDirection searchDirection); Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment); @Override Array<T> getElementsIntersectingLineSegment(LineSegment lineSegment, QuadTreeSearchDirection searchDirection); void getElementsIntersectingLineSegment(Array<T> result, LineSegment lineSegment); @Override void getElementsIntersectingLineSegment(Array<T> result, LineSegment lineSegment, QuadTreeSearchDirection searchDirection); Array<T> getElements(); void getElements(Array<T> result); int getTotalQuads(); int getTotalElements(); @Override void positionChanged(T moved); QuadTree<T> getParent(); int getTotalMergeOperations(); int getElementLimitPerQuad(); int getMergeWatermark(); @Override float getMinimumQuadWidth(); @Override float getMinimumQuadHeight(); static Color QUAD_COLOR; static Color ELEMENT_COLOR; }