Constructor Detail

• RTreeIntersectionTester

  public RTreeIntersectionTester()

  Create an intersection tester with an internal RTree that is created using the RTree.RTree(int, int) constructor with arguments 1 and 10 for min and max nodes.

• RTreeIntersectionTester

  public RTreeIntersectionTester(int minNodeEntries,
                                 int maxNodeEntries)

  Create an intersection tester with an internal RTree that is created using the RTree.RTree(int, int) constructor with the specified values for min and max nodes.

• RTreeIntersectionTester

  public RTreeIntersectionTester(RTree tree)

  Create an intersection tester using the the specified RTree for storing the covered regions. This will traverse all entries stored in the specified tree initially to determine the highest id already used.

  Parameters:

  tree - the rectangle tree to store covered regions in

Method Detail

• add

  public void add(Rectangle r,
                  boolean clone)

  Description copied from interface: RectangleIntersectionTester
  Mark the specified rectangle as covered. Subsequent calls to RectangleIntersectionTester.isFree(Rectangle) that intersect the specified rectangle will return false.

  Specified by:

  add in interface  RectangleIntersectionTester

  Parameters:

  r - the region to mark as covered

  clone - whether the argument can be stored or it should be cloned to a new object (depends on whether you're reusing the same object on your end)

• isFree

  public boolean isFree(Rectangle rectangle)

  Description copied from interface: RectangleIntersectionTester
  Query whether the specified region is free. A rectangle is free if it does not intersect any of the rectangles added to this data structure with RectangleIntersectionTester.add(Rectangle, boolean) before.

  Specified by:

  isFree in interface  RectangleIntersectionTester

  Parameters:

  rectangle - the region to test for

  Returns:

  whether the region does not intersect any rectangle added before.