perform boolean operations on arbitrary polygons in 2d
Routine to do 2d polygon boolean operations and triangulation.
Checks if a point is inside an area, like a city boundary.
Converts line(s) to polygon(s).
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Rewind using Shoelace Formula.
Takes polygons or multipolygons and an optional mask, and returns an exterior ring polygon with holes.
Takes a polygon and return true or false as to whether it is concave or not.
Operations for two-dimensional polygons.
Reduces the number of points in a shape while keeping its overall look.
Takes any LineString or Polygon GeoJSON and returns the intersecting point(s).
Apply boolean Polygon clipping operations (intersection, union, difference, xor) to your Polygons & MultiPolygons.
Checks if two geometries have an area of overlap without one being completely contained inside the other.
TypeScript definitions for d3-polygon
Javascript library for 2d geometry
compute the area of a 2d polygon
determine if a point is inside a polygon with a ray intersection counting algorithm
Check two valid geojson geometries for equality.
Checks if two geometries cross each other.
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.
Creates a honeycomb-like grid of hexagons within a bounding box.
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
No description provided.
No description provided.
No description provided.