This script finds all points where the polygons intersect each other.
TypeScript definitions for polygons-intersect
determine whether two polygons intersect in 2d
This script finds all points where the polygons intersect each other. This repository is a fork from DudaGod/polygons-intersect's package, traduced in typescript and fixed from minor bugs.
Get the intersection of multiple semver ranges
This script finds all points where the polygons intersect each other. This repository is a fork from DudaGod/polygons-intersect's package, traduced in typescript and fixed from minor bugs.
Takes a complex (i.e. self-intersecting) geojson polygon, and breaks it down into its composite simple, non-self-intersecting one-ring polygons.
Finds the shared area between two polygons.
Boolean operations on polygons (union, intersection, difference, xor)
Takes any LineString or Polygon GeoJSON and returns the intersecting point(s).
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Index for matching points against a set of GeoJSON polygons
Fill a polygon with lines
Find the intersection of two arrays
Get the intersection of multiple semver ranges.
Computes the intersection between two SVG paths
Globe data visualization as a ThreeJS reusable 3D object
Takes a set of points and a set of polygons and/or multipolygons and performs a spatial join.
Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Find self-intersections in geojson polygon (possibly with interior rings)
Merges a specified property from a FeatureCollection of points into a FeatureCollection of polygons.
Exact arithmetic test for line segment intersection
Polygon/polyline processing utilities
return the intersect of two arrays
Use Bentley-Ottmann algorithm to solve self-intersecting polygon issue
Perfect Shape is a collection of pure Ruby geometric algorithms that are mostly useful for GUI manipulation like checking viewport rectangle intersection or containment of a mouse click point in popular geometry shapes such as rectangle, square, arc (open, chord, and pie), ellipse, circle, polygon, and paths containing lines, quadratic bézier curves, and cubic bezier curves, potentially with affine transforms applied like translation, scale, rotation, shear/skew, and inversion (including both the Ray Casting Algorithm, aka Even-odd Rule, and the Winding Number Algorithm, aka Nonzero Rule). Additionally, it contains some purely mathematical algorithms like IEEEremainder (also known as IEEE-754 remainder).
No description provided.
No description provided.
No description provided.
No description provided.