code: function (x, y) {
              var intersects = false;
              var posx = this.pos.x, posy = this.pos.y;
              var points = this.points;
              var len = points.length;
  
              //http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html
              for (var i = 0, j = len - 1; i < len; j = i++) {
                  var iy = points[i].y + posy, ix = points[i].x + posx,
                      jy = points[j].y + posy, jx = points[j].x + posx;
                  if (((iy > y) !== (jy > y)) && (x < (jx - ix) * (y - iy) / (jy - iy) + ix)) {
                      intersects = !intersects;
                  }
              }
              return intersects;
          }
docs: check if this Polygon contains the specified point <br>
  (Note: it is highly recommended to first do a hit test on the corresponding <br>
  bounding rect, as the function can be highly consuming with complex shapes)
  @name containsPoint
  @memberOf me.Polygon.prototype
  @function
  @param  {Number} x x coordinate
  @param  {Number} y y coordinate
  @return {boolean} true if contains