private final int findWidestAxis(){
  int widest=0;
  double width=(maxLimit[0] - minLimit[0]) * getAxisWeightHint(0);
  if (Double.isNaN(width)) {
    width=0;
  }
  for (int i=1; i < dimensions; i++) {
    double nwidth=(maxLimit[i] - minLimit[i]) * getAxisWeightHint(i);
    if (Double.isNaN(nwidth)) {
      nwidth=0;
    }
    if (nwidth > width) {
      widest=i;
      width=nwidth;
    }
  }
  return widest;
}

private final int findWidestAxis ( ) { int widest = 0 ; double width = ( maxLimit [ 0 ] - minLimit [ 0 ] ) * getAxisWeightHint ( 0 ) ; if ( Double . isNaN ( width ) ) { width = 0 ; } for ( int i = 1 ; i < dimensions ; i ++ ) { double nwidth = ( maxLimit [ i ] - minLimit [ i ] ) * getAxisWeightHint ( i ) ; if ( Double . isNaN ( nwidth ) ) { nwidth = 0 ; } if ( nwidth > width ) { widest = i ; width = nwidth ; } } return widest ; }
find the widest axis of the bounds of this node
