{"_id":"point-in-polygon","_rev":"17-e171d42a9669ee9435efe1f60424b206","name":"point-in-polygon","description":"determine if a point is inside a polygon with a ray intersection counting algorithm","dist-tags":{"latest":"1.1.0"},"versions":{"0.0.0":{"name":"point-in-polygon","description":"determine if a point is inside a polygon with a ray intersection counting algorithm","version":"0.0.0","repository":{"type":"git","url":"git://github.com/substack/point-in-polygon.git"},"main":"index.js","keywords":["point","polygon","inside"],"directories":{"lib":".","example":"example","test":"test"},"scripts":{"test":"tap test/*.js"},"devDependencies":{"tap":"0.0.x"},"engines":{"node":">=0.4.0"},"license":"MIT","author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"_npmUser":{"name":"substack","email":"mail@substack.net"},"_id":"point-in-polygon@0.0.0","dependencies":{},"_engineSupported":true,"_npmVersion":"1.0.106","_nodeVersion":"v0.4.12","_defaultsLoaded":true,"dist":{"shasum":"09130fc5cdef218de5f9bdf0e6c4a3b2e1beae51","tarball":"https://registry.npmjs.org/point-in-polygon/-/point-in-polygon-0.0.0.tgz","integrity":"sha512-kV81I6IwoxTMkUUA371UNhJaD5Wj3Yva7haR8zcsB+8PrKxWBOQ1bAyyUUm/ZA7tPhvMZVeYFNzs8k7+BRjGxw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDJ17qlzYeOqGxpxOR33NKQ8OByyc8Znl7NGRYitJtTJAIgY3PqACuVYhK0oJalJuTB4tyXm9U2j6gKnFniRy1yaSk="}]},"maintainers":[{"name":"substack","email":"mail@substack.net"}]},"1.0.0":{"name":"point-in-polygon","description":"determine if a point is inside a polygon with a ray intersection counting algorithm","version":"1.0.0","repository":{"type":"git","url":"git://github.com/substack/point-in-polygon.git"},"main":"index.js","keywords":["point","polygon","inside"],"directories":{"lib":".","example":"example","test":"test"},"scripts":{"test":"tape test/*.js"},"devDependencies":{"tape":"^4.0.0"},"license":"MIT","author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"gitHead":"fcc078d5f302736aa09c5c87ae1337d798a9e9ef","bugs":{"url":"https://github.com/substack/point-in-polygon/issues"},"homepage":"https://github.com/substack/point-in-polygon#readme","_id":"point-in-polygon@1.0.0","_shasum":"f722230c368af6275621ee3839db34b6ee8758a2","_from":".","_npmVersion":"2.10.1","_nodeVersion":"2.0.0","_npmUser":{"name":"substack","email":"substack@gmail.com"},"dist":{"shasum":"f722230c368af6275621ee3839db34b6ee8758a2","tarball":"https://registry.npmjs.org/point-in-polygon/-/point-in-polygon-1.0.0.tgz","integrity":"sha512-Xq2EIsoPEWYfRB2fmkTBlQxJdwCBIt29siw8LtsMpolMSApkjwhyFdrGfb4BbQOcG2I03fiH1NXO66XgnfMlhg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDHfWDHHIPlkDJvrRwGllmwrLv7+o3Zrc1gdg+qs9wzkAiB0yLn6lvGNb+iTkoAT+omfQNeMNuGZInr3877DLbYuZw=="}]},"maintainers":[{"name":"substack","email":"mail@substack.net"}]},"1.0.1":{"name":"point-in-polygon","description":"determine if a point is inside a polygon with a ray intersection counting algorithm","version":"1.0.1","repository":{"type":"git","url":"git://github.com/substack/point-in-polygon.git"},"main":"index.js","keywords":["point","polygon","inside"],"directories":{"lib":".","example":"example","test":"test"},"scripts":{"test":"tape test/*.js"},"devDependencies":{"tape":"^4.0.0"},"license":"MIT","author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"gitHead":"e1888ce59696a5713b5520cbc17fa268ee703229","bugs":{"url":"https://github.com/substack/point-in-polygon/issues"},"homepage":"https://github.com/substack/point-in-polygon#readme","_id":"point-in-polygon@1.0.1","_shasum":"d59b64e8fee41c49458aac82b56718c5957b2af7","_from":".","_npmVersion":"3.7.1","_nodeVersion":"5.5.0","_npmUser":{"name":"substack","email":"substack@gmail.com"},"dist":{"shasum":"d59b64e8fee41c49458aac82b56718c5957b2af7","tarball":"https://registry.npmjs.org/point-in-polygon/-/point-in-polygon-1.0.1.tgz","integrity":"sha512-7xblajMJtE9xOfDXkZrq98kjnoazmNPfNXqu9XCKk0uhtjImNdTRjkckIWKirtlyUocWU9XyzTyE2y5/E45v5A==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIF/JWXfYMKGQbBZyb0zc39fL1KKkva7U+j1gej3CugBoAiAF3UBFQM5Kx91U5CWJ9ixzSeNe+4HTTzHlS7VVDXKvlg=="}]},"maintainers":[{"name":"substack","email":"mail@substack.net"}],"_npmOperationalInternal":{"host":"packages-16-east.internal.npmjs.com","tmp":"tmp/point-in-polygon-1.0.1.tgz_1467779094097_0.1194892106577754"}},"1.0.2":{"name":"point-in-polygon","description":"determine if a point is inside a polygon with a ray intersection counting algorithm","version":"1.0.2","repository":{"type":"git","url":"git://github.com/substack/point-in-polygon.git"},"main":"index.js","keywords":["point","polygon","inside"],"directories":{"lib":".","example":"example","test":"test"},"scripts":{"test":"tape test/*.js"},"devDependencies":{"tape":"^4.0.0"},"license":"MIT","author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"gitHead":"5081a4a92d0a40a01e166296163407081aa052c7","bugs":{"url":"https://github.com/substack/point-in-polygon/issues"},"homepage":"https://github.com/substack/point-in-polygon#readme","_id":"point-in-polygon@1.0.2","_nodeVersion":"12.18.2","_npmVersion":"6.14.9","dist":{"integrity":"sha512-iKkpCkCKHMkEzdP0z2HTs5N7F5qQ01U6z+9gVa4rTjoiW0xpJu8RbNB/8gf+U4z6vTPLRzbpj32ZXKPNht9gPw==","shasum":"1a73773566092dcb563e5fdc05bbecce96f25caa","tarball":"https://registry.npmjs.org/point-in-polygon/-/point-in-polygon-1.0.2.tgz","fileCount":6,"unpackedSize":4233,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgT+cnCRA9TVsSAnZWagAA9AsP/2+M1jrl9nXZGkd9aokB\n4eY8CZ3F/szZX89hqbuMYbGKpqWNokKTvnM3v/taLXaCOAcaF0hmi353BRl4\n2wC0lS1Cc6/pDPor+Xa0U0PkCiQKwckimcljwssB+klSvTMCq8VsNF/gnwv7\nzn5eEbrSUm0ijpPwk4opv5491CJJzdVIipGACXPu79+qd5CM5ndcgv3VmCsV\n5aPgd7uxYU0uinjEbOqQOQhezO+oW1cZ0khyX581ng7ryUI/jyAiHtLNeWCS\nx59XE68jWiz13cM+lAr5KiaCbSTJtbEMs3IM0ZnPydzMAfUHnuOR8qL9+Xqn\nzLPSinYlhY2561QvOEMepNPFs4Mz31IcpPo/ABwPyNEj1rCcaFkjoxnIji9M\npyeAcr00LTAUJrYnz/ALUcSSAWaQLEw8wqCVvqcX8vux50GHNbjAVpmk/vbY\nQNmQ0Q77S5sfq4Z3nv8vEGWYuOLXj3i6H34OOAnTP7xUsUjAGq3NCROuC84E\nneXVjSO04PEgqr2TDWF8vi021LoEWgvMY2eFGU4M2WDVKvY1JPOepS/qUrat\nzjriMb9QiDGUP4eKbEdWA/nawDAMpeZA6p0PTBE0Dd2iSfPwSi1hM8Q0O3sV\ne+XwguFKw6dDVFrkdLXQAOvkRrY1KfuKO+A/O8L4qhvuU1lMTk1NNU1HVt4D\nOsn/\r\n=j91F\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC3iPVfA6QGlnn+qSPQcooVE6Fbf9blxD0i9kqXJxQXJAIgVL0DQkY1qbOBlz2N5GpwZUO1qscbuzVzfD5YS9bt01Y="}]},"_npmUser":{"name":"substack","email":"substack@gmail.com"},"maintainers":[{"name":"substack","email":"substack@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/point-in-polygon_1.0.2_1615849255202_0.25244458139267145"},"_hasShrinkwrap":false},"1.1.0":{"name":"point-in-polygon","description":"determine if a point is inside a polygon with a ray intersection counting algorithm","version":"1.1.0","repository":{"type":"git","url":"git://github.com/substack/point-in-polygon.git"},"main":"index.js","keywords":["point","polygon","inside"],"directories":{"lib":".","example":"example","test":"test"},"scripts":{"test":"tape test/*.js"},"devDependencies":{"tape":"^4.0.0"},"license":"MIT","author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"gitHead":"24761fb3737d8d0d2a68dcf8be2c36c6a12cd1b8","bugs":{"url":"https://github.com/substack/point-in-polygon/issues"},"homepage":"https://github.com/substack/point-in-polygon#readme","_id":"point-in-polygon@1.1.0","_nodeVersion":"12.18.2","_npmVersion":"6.14.9","dist":{"integrity":"sha512-3ojrFwjnnw8Q9242TzgXuTD+eKiutbzyslcq1ydfu82Db2y+Ogbmyrkpv0Hgj31qwT3lbS9+QAAO/pIQM35XRw==","shasum":"b0af2616c01bdee341cbf2894df643387ca03357","tarball":"https://registry.npmjs.org/point-in-polygon/-/point-in-polygon-1.1.0.tgz","fileCount":11,"unpackedSize":8697,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgT/ZTCRA9TVsSAnZWagAAgo0P/0HgiWxe2hqSs3UNtr1F\no4m8t8k/pfwKGdVWOoq0b22mPMEBZv53g3hgKC22atyq9emRO1+jW90NN424\nFUg0XvhEsdpyR9Fjlo6VGpXRLXbBthoMTnEpuamc2Q808Bnj7Eie6QYY6LmL\nLyD7BJ6dHDzNoM5LHQbSrwqAsvmNJajZj3uv4KZYk2Yf3PPf2qIny5iAh1dO\n05xWRd8MSDHchJZLQMJgbq45KjXyAoz63tMCV9IZq8oKbc7NuDr7vHDbdtv0\nrb8a/5AuVtchYEG1TM+A7x2Wv7PvmLdc4gPzZqjjJmVvykgBzdqcWTgJHLW7\nOemTk9KsK6isZOnBiR8k2qik0JLyo6G0JaCZ23jxTdTJ+9/PKMmf4enYHxIf\nN1NMdqGp2+IeuHNumevgfg+q2puRjM9KrbullW8WDHjnq/j6w9KYG9hECA2q\njtkzStJv/89o43n+oifT79xhZBT4bCFZPm1S3yQ1HlSQM9T3G5mYy+zhUe33\nk2ueM6koR+8ocwTw/Oiiw5drKfy4g0SDhLbQ+Y0+KMghqbnBp+6qBxK60Ee9\nMbwz091WcCarnHqqNoanZopXjpxuoIqP1ME+Z3G02XKvF3+839JYBmXLLrra\n4s283jmeMBqj5gZBiE0jsvIs9ZBCvQ3sdalpWhOp/LwtpnDEYpbVsi7Od83r\n9f+g\r\n=+9m6\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDWPnHaKN7y+wGnRrN0/vYws9dcY5Ez/d/1gnOjxp50TAiAPpA6Rh8kdZ2fKVmFN/RItatAoqFusO/iTkX48jPXdGg=="}]},"_npmUser":{"name":"substack","email":"substack@gmail.com"},"maintainers":[{"name":"substack","email":"substack@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/point-in-polygon_1.1.0_1615853138648_0.1543889365842157"},"_hasShrinkwrap":false}},"readme":"# point-in-polygon\n\nDetermine if a point is inside of a polygon.\n\nThis module casts a semi-infinite ray from the inquiry point and counts intersections,\nbased on\n[this algorithm](https://wrf.ecse.rpi.edu/Research/Short_Notes/pnpoly.html).\n\nIf you need a numerically robust solution and are willing to trade some performance for it,\nuse [robust-point-in-polygon](https://github.com/mikolalysenko/robust-point-in-polygon).\n\n# example\n\n``` js\nvar pointInPolygon = require('point-in-polygon');\nvar polygon = [ [ 1, 1 ], [ 1, 2 ], [ 2, 2 ], [ 2, 1 ] ];\n\nconsole.log(pointInPolygon([ 1.5, 1.5 ], polygon)); // true\nconsole.log(pointInPolygon([ 4.9, 1.2 ], polygon)); // false\nconsole.log(pointInPolygon([ 1.8, 1.1 ], polygon)); // true\n```\n\n# methods\n\n``` js\nvar pointInPolygon = require('point-in-polygon')\nvar pointInPolygonFlat = require('point-in-polygon/flat')\nvar pointInPolygonNested = require('point-in-polygon/nested')\n```\n\n## pointInPolygon(point, polygon, start=0, end=polygon.length)\n\nReturn whether `point` is contained in `polygon`.\n\n* `point` should be a 2-item array of coordinates\n* `polygon` should be an array of 2-item arrays of coordinates or a flat array of coordinates\n* `start` is an offset into `polygon`. default `0`\n* `end` is an offset into `polygon`. default `polygon.length`\n\nThe flat or nested is detected automatically. Or you can use the specific methods if you want to\nskip the check.\n\n# install\n\n```\nnpm install point-in-polygon\n```\n\n# license\n\nMIT\n","maintainers":[{"email":"nopersonsmodules@gmail.com","name":"nopersonsmodules"}],"time":{"modified":"2022-11-08T10:40:17.060Z","created":"2012-01-01T20:26:13.942Z","0.0.0":"2012-01-01T20:26:16.441Z","1.0.0":"2015-06-13T17:59:39.967Z","1.0.1":"2016-07-06T04:24:57.831Z","1.0.2":"2021-03-15T23:00:55.342Z","1.1.0":"2021-03-16T00:05:38.792Z"},"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"repository":{"type":"git","url":"git://github.com/substack/point-in-polygon.git"},"users":{"marinho":true,"acollins-ts":true,"onesimusrex":true,"marcosc90":true,"scott.m.sarsfield":true},"homepage":"https://github.com/substack/point-in-polygon#readme","keywords":["point","polygon","inside"],"bugs":{"url":"https://github.com/substack/point-in-polygon/issues"},"license":"MIT","readmeFilename":"readme.markdown"}