not-inside-quick.js

var pts = // my point featurecollection
var polys = // my poly featurecollection

var tree = rbush()

polys.features.forEach(function(poly, i){
  var bbox = turf.bbox(poly)
  var idx = {
    minX: bbox[0],
    minY: bbox[1],
    maxX: bbox[2],
    maxY: bbox[3],
    id: i // store polygon's bbox with its index in the featurecollection
  };
})

pts.features = pts.features.filter(function(pt){
  var isInside = false

  // find polygons with bboxes enclosing the point
  var collisions = tree.search({
    minX: pt.geometry.coordinates[0],
    minY: pt.geometry.coordinates[1],
    maxX: pt.geometry.coordinates[0],
    maxY: pt.geometry.coordinates[1]
  })

  collisions
  .map(function(collision){
    // lookup polygon by the index of the feature
    return polys.features[collision.id]
  })
  .forEach(function(poly){
    // flip the status if point is inside polygon's hull
    if(turf.inside(pt, poly)) isInside = true
  })
  return isInside
})