compute the area of a 2d polygon

Zero-dependency Manifold WASM runtime for 2D polygon operations

2D polygon/polyline analysis & processing utilities

Small, typed, dependency free tool to round corners of 2d-polygon provided by an array of { x, y } points.

2D polygon clipping / offsetting (Sutherland-Hodgeman, Grainer-Hormann)

This library may not be fast, but it is robust. Robust in the fact that it will find all of the self-intersections in a polygon - minus of course shared endpoints.

perform boolean operations on arbitrary polygons in 2d

Routine to do 2d polygon boolean operations and triangulation.

Lightweight 2D polygon navmesh pathfinding: triangulation + A* + funnel + smoothing.

Extrude 2D polygon outlines into THREE.BufferGeometry using Delaunay tessellation (triangle-wasm)

2D Polygon math: boolean operations, triangulation, graphs, support for holes and non-convex shapes.

Operations for two-dimensional polygons.

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.

Fill a polygon with lines

TypeScript definitions for d3-polygon

Calculates the distance from a point to the edges of a polygon or multi-polygon.

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.