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.
Operations for two-dimensional polygons.
Fill a polygon with lines
Calculates the distance from a point to the edges of a polygon or multi-polygon.
Takes a Feature or FeatureCollection and returns a Point guaranteed to be on the surface of the feature.
A JS library for finding optimal label position inside a polygon
Find self-intersections in geojson polygon (possibly with interior rings)
Takes a triangular plane as a polygon and a point within that triangle, and returns the z-value at that point.
Finds the tangents of a polygon from a point.
Returns the shortest path from start to end without colliding with any Feature in obstacles.
TypeScript definitions for point-in-polygon
TypeScript definitions for d3-polygon
Finds points that fall within polygon(s).
Takes a Point and calculates the ellipse polygon given two semi-axes expressed in variable units and steps for precision.
Creates a circular sector of a circle.
Takes a point and calculates the circle polygon given a radius.
Takes any LineString or Polygon GeoJSON and returns the intersecting point(s).
Industrial strength point in polygon test
Exactly test if a point is inside, outside or on the boundary of a polygon
Fast point-in-polygon intersection for large numbers of polygons.
Merges a specified property from a FeatureCollection of points into a FeatureCollection of polygons.
Creates a grid of points within a bounding box.