question: public List < T > range ( final double [ ] lowk , final double [ ] uppk ) throws KeySizeException { if ( lowk . length != uppk . length ) { throw new KeySizeException ( ) ; } else if ( lowk . length != m_K ) { throw new KeySizeException ( ) ; } else { final List < KDNode < T > > found = new LinkedList < KDNode < T > > ( ) ; KDNode . rsearch ( new HPoint ( lowk ) , new HPoint ( uppk ) , m_root , 0 , m_K , found ) ; final List < T > o = new LinkedList < T > ( ) ; for ( final KDNode < T > node : found ) { o . add ( node . v ) ; } return o ; } }
target:  Range search in a KD-tree. Uses algorithm translated from 352.range.c of Gonnet & Baeza-Yates.