/** * Construct the ByteNearestNeighboursKDTree with the given options. * * @param pnts the data * @param ntrees the number of trees * @param nchecks the number of checks during search */ public ByteNearestNeighboursKDTree(final byte [][] pnts, int ntrees, int nchecks) { kdt = new ByteKDTreeEnsemble(pnts, ntrees); this.nchecks = nchecks; }
/** * Construct the ByteNearestNeighboursKDTree with the given options. * * @param pnts the data * @param ntrees the number of trees * @param nchecks the number of checks during search */ public ByteNearestNeighboursKDTree(final byte [][] pnts, int ntrees, int nchecks) { kdt = new ByteKDTreeEnsemble(pnts, ntrees); this.nchecks = nchecks; }