generate an array of geohashes that completely contain a polygon
Operations for two-dimensional polygons.
TypeScript definitions for d3-polygon
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
determine if a point is inside a polygon with a ray intersection counting algorithm
Checks if a point is inside an area, like a city boundary.
Generate hashes from javascript objects in node and the browser.
Converts a bounding box to a GeoJSON polygon.
Calculates the distance from a point to the edges of a polygon or multi-polygon.
Fill a polygon with lines
Takes a kinked polygon and returns a feature collection of polygons that have no kinks.
Smooths a Polygon or MultiPolygon, based on Chaikin's algorithm.
Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Takes polygons or multipolygons and an optional mask, and returns an exterior ring polygon with holes.
Apply boolean Polygon clipping operations (intersection, union, difference, xor) to your Polygons & MultiPolygons.
Stable JS value hash.
ThreeJS geometry for drawing polygons on a sphere
Implementation of JSON Web Signatures
A MurmurHash2 implementation
Finds points that fall within polygon(s).
JWA implementation (supports all JWS algorithms)
Finds the tangents of a polygon from a point.
A JS library for finding optimal label position inside a polygon
Calculates the geodesic area in square meters of one or more polygons.
No description provided.
No description provided.