基于射线法实现快速判定点是否在面内
Finds points that fall within polygon(s).
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
A JS library for finding optimal label position inside a polygon
Checks if a point is inside an area, like a city boundary.
Fill a polygon with lines
Operations for two-dimensional polygons.
Takes a triangular plane as a polygon and a point within that triangle, and returns the z-value at that point.
Calculates the distance from a point to the edges of a polygon or multi-polygon.
Finds the tangents of a polygon from a point.
Takes a Feature or FeatureCollection and returns a Point guaranteed to be on the surface of the feature.
Merges a specified property from a FeatureCollection of points into a FeatureCollection of polygons.
Find self-intersections in geojson polygon (possibly with interior rings)
Calculates an index based the average distances between points in the dataset, thereby providing inference as to whether the data is clustered, dispersed, or randomly distributed within the study area.
A JS library for finding optimal label position inside a polygon
Determines the geometric center of a polygon or shape.
TypeScript definitions for point-in-polygon
Returns the shortest path from start to end without colliding with any Feature in obstacles.
TypeScript definitions for d3-polygon
Takes a point and calculates the circle polygon given a radius.
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 any LineString or Polygon GeoJSON and returns the intersecting point(s).