public void calcWelzl(FloatBuffer points){
  if (center == null) {
    center=new Vector3f();
  }
  FloatBuffer buf=BufferUtils.createFloatBuffer(points.limit());
  points.rewind();
  buf.put(points);
  buf.flip();
  recurseMini(buf,buf.limit() / 3,0,0);
}

public void calcWelzl ( FloatBuffer points ) { if ( center == null ) { center = new Vector3f ( ) ; } FloatBuffer buf = BufferUtils . createFloatBuffer ( points . limit ( ) ) ; points . rewind ( ) ; buf . put ( points ) ; buf . flip ( ) ; recurseMini ( buf , buf . limit ( ) / 3 , 0 , 0 ) ; }
calculates a minimum bounding sphere for the set of points . the algorithm was originally found at http : / / www . flipcode . com / cgi - bin / msg . cgi ? showthread = cotd - smallestenclosingspheres & forum = cotd & id = - 1 in c + + and translated to java by cep21
