int[] findNearestVacantArea(int pixelX,int pixelY,int spanX,int spanY,int[] result){
  return findNearestVacantArea(pixelX,pixelY,spanX,spanY,spanX,spanY,result,null);
}

int [ ] findNearestVacantArea ( int pixelX , int pixelY , int spanX , int spanY , int [ ] result ) { return findNearestVacantArea ( pixelX , pixelY , spanX , spanY , spanX , spanY , result , null ) ; }
find a vacant area that will fit the given bounds nearest the requested cell location . uses euclidean distance to score multiple vacant areas .
