determine whether two polygons intersect in 2d
Finds the shared area between two polygons.
Takes any LineString or Polygon GeoJSON and returns the intersecting point(s).
Find self-intersections in geojson polygon (possibly with interior rings)
Get the intersection of multiple semver ranges
Takes a complex (i.e. self-intersecting) geojson polygon, and breaks it down into its composite simple, non-self-intersecting one-ring polygons.
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Operations for two-dimensional polygons.
TypeScript definitions for d3-polygon
Light-weight JavaScript Bounding Box Utility Functions
Index for matching points against a set of GeoJSON polygons
Lasso selection plugin for Leaflet
determine if a point is inside a polygon with a ray intersection counting algorithm
Boolean operations on polygons (union, intersection, difference, xor)
Checks if a point is inside an area, like a city boundary.
Any dimensional box intersection
Find the intersection of two arrays
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
Computes the intersection between two SVG paths
Get the intersection of multiple semver ranges.
Takes polygons or multipolygons and an optional mask, and returns an exterior ring polygon with holes.
Takes a kinked polygon and returns a feature collection of polygons that have no kinks.