ProGAL.dataStructures.rangeSearching.rangeTree
Class RangeTreeNode2d

java.lang.Object
  ProGAL.dataStructures.rangeSearching.rangeTree.RangeTreeNode
      ProGAL.dataStructures.rangeSearching.rangeTree.RangeTreeNode2d

public class RangeTreeNode2d
extends RangeTreeNode

Constructor Summary

RangeTreeNode2d(java.util.List<java.util.List<Point>> sortedpoints, int dimension)
Initialize the RangeTreeNode for 2 dimensions.

Method Summary

java.util.List<Point>

query(double[] low, double[] high) Return the points inside the given range.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

RangeTreeNode2d

public RangeTreeNode2d(java.util.List<java.util.List<Point>> sortedpoints,
                       int dimension)

Initialize the RangeTreeNode for 2 dimensions. We expect that sortedpoints.size() == 2.

Method Detail

query

public java.util.List<Point> query(double[] low,
                                   double[] high)

Return the points inside the given range. We know that this is a 2D tree so we know the absolute dimension

Specified by:

query in class RangeTreeNode