Multiplies polynomials together using an FFT
fft
Insanely Fast Fourier Transform (radix-4)
Tesselates a polygon or multipolygon into a collection of triangle polygons using earcut.
Simple pure Javascript implementation of the Cooley-Tukey algorithm. Note: fft-js was chosen as the name since a lot of the FFT implementations on NPM at the time this was published were wrappers for Ruby or C.
Convex decomposition for 2D polygons
Digital Signal Processing for Javascript
A polyfill for crypto.randomFill and crypto.randomFillSync from Node.js core
Converts a polygon to a line string.
Moves a shape or location in a specific direction.
Takes a GeoJSON feature and returns points at all self-intersections.
Changes the size of a geometry by scaling it up or down.
The Fastest Fourier Transform on the Web! 🚀🚀
Takes a kinked polygon and returns a feature collection of polygons that have no kinks.
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Rotates a geometry around its center or a given point.
Takes a Feature and a bbox and clips the feature to the bbox using lineclip.
Minimalistic and efficient FFT implementation
Converts a bounding box to a GeoJSON polygon.
Convex decomposition for 2D polygons
generate the minimum number of tiles to cover a geojson geometry
Checks if a point is inside an area, like a city boundary.
KISS FFT library, compiled to WASM. Intended for use with Echogarden.
FFT for ndarrays