Solve for polygon interior using the non-zero winding rule and triangulate
enforce winding order for geojson
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Takes a complex (i.e. self-intersecting) geojson polygon, and breaks it down into its composite simple, non-self-intersecting one-ring polygons.
Rewind using Shoelace Formula.
Operations for two-dimensional polygons.
enforce winding order for geojson
Fix the winding order of GeoJSON
TypeScript definitions for d3-polygon
Convex decomposition for 2D 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.
Converts a bounding box to a GeoJSON polygon.
RVF self-learning temporal solver — Thompson Sampling, PolicyKernel, ReasoningBank
Calculates the distance from a point to the edges of a polygon or multi-polygon.
Fill a polygon with lines
Smooths a Polygon or MultiPolygon, based on Chaikin's algorithm.
Takes a kinked polygon and returns a feature collection of polygons that have no kinks.
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.
TypeScript implementation of GeoArrow
Apply boolean Polygon clipping operations (intersection, union, difference, xor) to your Polygons & MultiPolygons.
ThreeJS geometry for drawing polygons on a sphere
Finds points that fall within polygon(s).