Geofence.inside() should be faster than utils.pointInPolygon: iterations: 1000000, innout: 48ms, pointinpolygon: 747ms
npm install in-n-out
Geofence(vertices, granularity = 20)Using the Geofence class you can determine whether a point is inside the geofence or not. Upon construction, the geofence's bounding box is broken down into tiles. The tiles that either intersect or are inside the geofence are tracked in a hash table. `
queries then use this cache to quickly answer
var InNOut = require('in-n-out'); var gf = new InNOut.Geofence([[0,0], [1,0], [1,1], [0,1], [0,0]], 100); gf.inside([0.5,0.5]); // true gf.inside([100,100]); // false
Just like GeoJSON supports interior rings for polygons, the `
Geofence` class may also be passed multiple sets of vertices. If you do, the first set is taken to be the exterior ring, and all subsequent sets are taken as interior rings ("holes").
The geofence's bbox will be broken down into a granularity x granylarity grid, defaulting to 20x20.
var InNOut = require('in-n-out'); var whiteoutGf = new InNOut.Geofence([[0,0], [1,0], [1,1], [0,1], [0,0]]); var blackoutGf = new InNOut.Geofence([[0.5,0], [1,0], [1,1], [0.5,1], [0.5, 0]]); var gfGroup = new InNOut.GeofencedGroup(); gfGroup.add(1, [whiteoutGf], [blackoutGf]); gfGroup.getValidKeys([0.1, 0.1]); //  - Included by whiteout gfGroup.getValidKeys([0.6, 0.6]); //  - Excluded by blackout gfGroup.getValidKeys([100, 100]); //  - Excluded by whiteout
The inclusion logic is as follows:
- If there are blackout zones, exclude the point if it is inside any of them
- If there are whiteout zones
- Include the point
Passing null for the geofence arrays is the same as `
GeofenceCacheThis provides a relatively primitive caching mechanism which allows you to bypass tile creation for identical geofences. It's basically a drop-in replacement for
new Geofence(). It keeps all geofences around so if you use many of them you'll run out of memory.
var geofenceCache = new GeofenceCache(); var geo = geofenceCache.getGeo([[0,0], [1,0], [1,1], [0,1], [0,0]];
License (MIT)Copyright (C) 2013 by Uber Technologies, Inc.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.