A library for finding the intersection of two polygons
Fast point-in-polygon intersection for large numbers of polygons.
Find self-intersections in geojson polygon (possibly with interior rings)
Apply boolean Polygon clipping operations (intersection, union, difference, xor) to your Polygons & MultiPolygons.
A BVH implementation to speed up raycasting against three.js meshes.
Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Query for performing multi-layer polygon intersection queries
A module to check if a polygon self-intersects using a sweepline algorithm
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.
Monitor if a component is inside the viewport, using IntersectionObserver API
Checks if two geometries have an area of overlap without one being completely contained inside the other.
Operations for two-dimensional polygons.
Polygon and line clipping and offsetting library for Javascript / Typescript - a port of Angus Johnson's clipper to WebAssembly / Asm.JS
Checks if two geometries cross each other.
TypeScript definitions for d3-polygon
Apply boolean polygon clipping operations (intersection, union, difference, xor) to your Polygons & MultiPolygons.
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Reference Implementation of the Dufour-Peyton Intersection Algorithm. Calculates the Intersections of Arbitrary Polygons with a Geospatial Raster.
A React hook for the IntersectionObserver API that uses a polyfill when the native API is not available
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.
Tracks the intersection of a DOM element and its containing element or the viewport.
Converts a bounding box to a GeoJSON polygon.
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.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.