The fastest, lightest, dependency-free, TypeScript-first 2D physics engine for JavaScript — with cross-platform deterministic multiplayer.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Fast 2D Poisson Disk Sampling based on a modified Bridson algorithm
Fast 2D convex hull (Graham Scan)
Fast 2D contour line extraction / generation
Fast 2d game engine.
Fast 2D point insertions and spatial querying over a fixed grid.
A WebGL based fast 2D primitives renderer.
Fast 2d geometry math: Vector2, Rectangle, Circle, Matrix2x3 (2D transformation), Circle, BoundingBox, Line2, Segment2, Intersections, Distances, Transitions (animation/tween), Random numbers, Noise
Fast 2d array suitable for dynamic programming
Fast 2D pathfinding library using triangulated navmesh
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
Lighting fast 2d graphics without canvas
2D HTML5 Rendering and Layout
A lightweight, blazingly fast 2D image descriptor, matcher and retriever, based on the MPEG-7 Color Layout Descriptor (CLD)
Fast 2D/3D spatial indexing and search
simplex-noise is a fast simplex noise implementation in Javascript. Works in node and in the browser.
Fast 2D WebGL renderer
Fast 2d segment intersection following Schneider and Eberly
RDT Spatial Index for Node.js: reference and fast 2D adaptive spatial indexing
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Fast deep equal
Fastest deep equal comparison for React. Great for React.memo & shouldComponentUpdate. Also really fast general-purpose deep comparison.
A pure-JS implementation of the W3C's Canvas-2D Context API that can run on top of either Expo Graphics or a browser WebGL context.
A kdtree is a data structure that makes it possible to quickly solve the nearest neighbor problem. This is a native 2d kdtree suitable for production use with millions of points.
Blazingly fast 2d kdtree.
KDTree updated for Ruby 1.9.x
Sangaku Eyeball uses Gosu, a 2D Game Library, to display lines, polygons and so on as defined by the Sangaku gem. It allows you to draw arbitrary polygons and then locate the Pole of Inaccessibility (usually the best place to display a label) using a fast, iterative algorithm.
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.