mljs / savitzky-golay
Savitzky–Golay filter
☆34Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for savitzky-golay
- gets miter normals for a 2D polyline☆132Updated 11 months ago
- GLSL setup for performing a Fast Fourier Transform of real-valued input☆47Updated 6 years ago
- Component-wise operations for ndarrays☆122Updated 4 years ago
- ☆53Updated last year
- RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids☆84Updated last month
- Tools for manipulating simplicial complexes in JavaScript☆63Updated 9 years ago
- The primary repository for the Stardust visualization library.☆100Updated last year
- 3D parametric surface visualization☆54Updated 5 months ago
- Robustly computes the orientation of a tuple of points☆26Updated 3 years ago
- A series of webgl experiments to explore fourier transform calculation complexity.☆48Updated 8 years ago
- Chaikin's smoothing algorithm for 2D polylines☆88Updated 6 years ago
- Arbitrary dimensional level sets☆100Updated 3 years ago
- Smoothly animating points with regl☆80Updated 6 years ago
- 2D axes☆29Updated 6 months ago
- Splits a convex polygon by a plane☆16Updated 10 years ago
- A JavaScript tool for working with polygons.☆53Updated 7 years ago
- Read floating point values back from WebGL☆42Updated 10 years ago
- A JS library to find the convex hull of a finite set of 3d points☆136Updated 2 months ago
- A very fast JavaScript polyline and polygon clipping library☆173Updated 2 years ago
- Robust and fast 2D convex hull☆47Updated 2 years ago
- Density Based Clustering in JavaScript☆216Updated 5 years ago
- collection of emscripten use cases of how to port C/C++ functions to JS☆30Updated 9 years ago
- JS tool to break self-intersecting GeoJSON polygons down in their constituent non-self-intersecting parts☆82Updated 5 years ago
- FFT for ndarrays☆48Updated 8 years ago
- Fast JavaScript icosphere mesh generation library for WebGL visualizations☆55Updated 5 years ago
- A JS implementation of the MINGLE edge bundling algorithm☆206Updated 9 years ago
- Yet another octree☆50Updated 8 years ago
- Solving the problem of cutting a given polygon into any number of areas of given squares with a lines of minimal length☆21Updated last year
- Bentley-Ottman sweepline algorithm implementation in js☆15Updated last year
- Detect self-intersecting polygons in Javascript. An implementation of the Bentley–Ottmann sweep line algorithm for detecting crossings in…☆31Updated 13 years ago