Determine if an x y coordinate exists in a polygon.
Return the center for a given SVG polygon points
Tiny library to manipulate SVG Polygon points
Operations for two-dimensional polygons.
TypeScript definitions for d3-polygon
Fill a polygon with lines
Finds points that fall within polygon(s).
Calculates the distance from a point to the edges of a polygon or multi-polygon.
Merges a specified property from a FeatureCollection of points into a FeatureCollection of polygons.
Draw perfect pressure-sensitive freehand strokes.
Finds the tangents of a polygon from a point.
A fast polyline and polygon clipping library.
Takes a feature or set of features and returns all positions as points.
Ensure GeoJSON polygon points are clockwise
A JS library for finding optimal label position inside a polygon
Creates a grid of points within a bounding box.
Takes a set of points and a set of polygons and/or multipolygons and performs a spatial join.
Polygon and line clipping and offsetting library for Javascript / Typescript - a port of Angus Johnson's clipper to WebAssembly / Asm.JS
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Returns the shortest path from start to end without colliding with any Feature in obstacles.
A package for applying Chaikin (ish) algorithm on polygon points
A module to check if a polygon self-intersects using a sweepline algorithm
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Takes a GeoJSON feature and returns points at all self-intersections.
Determine if a point is inside a polygon with a Sweep Line method
Simple small tool for finding points in polygon
Validate points inside polygons
Use Bentley-Ottmann algorithm to solve self-intersecting polygon issue
Generate KML polygons (circle, star etc.) from lat/long and radius A port of http://blog.client9.com/2007/09/drawing-circles-and-stars-on-google.html
Finds if a point is contained within a Polygon
Check if points are inside or outside the region polygons in an imported KML file.
Sangaku contains classes for Point, Line, Polygon, AABB and so on in 2D. It can find the 'pole of inaccessibility' for a polygon. And it can simply the boundary of a polygon to minimise points while retaining detail. It works well with Gosu.
You can use this gem to reduce the number of points in a complex polyline / polygon, making use of an optimized Douglas-Peucker algorithm. Ruby port of Simplify.js.
Geographic point calculations including Haversine/Vincenty distance, bearing, midpoint, destination point, geohash encoding/decoding, cross-track distance, polygon containment, rhumb line navigation, bounding box, and DMS formatting. Zero dependencies.
Provides native implementations of Vincenty ellipsoidal functions and a native implementation of a ray casting algorithm to detect if a point is contained in a polygon.
Lets you import a KML file and then check if points are inside or outside region polygons defined by the file.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.