code: private List<Point2D> getNeighbors(final Point2D point, KDTree<Point2D> points) {
      	double[] key = {point.x, point.y};
          final List<Point2D> neighbors = new ArrayList<Point2D>();
          
          neighbors.addAll(points.nearestEuclidean(key, eps));
          
          return neighbors; 
      }
docs: Returns a list of density-reachable neighbors of a {@code point}.
  
  @param point the point to look for
  @param points possible neighbors
  @return the List of neighbors