Quad tree that can store 2D objects.
-
Retrieve the bounding box of this sub tree.
Determine the bounding box.
Retrieve the bounding rectangle.
boolean
Determine if this Rectangle contains all points of another Rectangle.
boolean
Determine if this Rectangle intersects another Rectangle.
Find all elements intersecting a given bounding box.
Recursively collect all elements that intersect the given rectangle.
(package private)
Construct a new RectangleAndPayload object.
(package private)
Construct a new sub tree.