code: function( dir, result ){
  
              var ch
                  ,i
                  ,l = this.children.length
                  ,scratch = Physics.scratchpad()
                  ,v = scratch.vector()
                  ,len = 0
                  ,maxlen = 0
                  ;
  
              result = result || new Physics.vector();
  
              // find the one with the largest projection along dir
              for ( i = 0; i < l; i++ ) {
                  ch = this.children[ i ];
                  ch.g.getFarthestHullPoint( dir.rotate(-ch.angle), v );
                  len = v.rotate(ch.angle).vadd( ch.pos ).proj( dir.rotate(ch.angle) );
  
                  if ( len > maxlen ){
                      maxlen = len;
                      result.swap( v );
                  }
              }
  
              return scratch.done( result );
          }
docs: extended NOTE: unlike other geometries this can't be used in the GJK algorithm because the shape isn't garanteed to be convex