Search results
48 packages found
n-D spatial indexing data structures with a shared ES6 Map/Set-like API
Provides a Point class that can be used to perform 2d vector operations. The Point class has convenient methods for calculating distance, magnitude (length), direction and angle (degrees and radians) to and from other Points or Point-like objects that hav
nD Stratified grid and Poisson-disc sampling w/ support for spatial density functions and custom PRNGs
Take a transformation matrix like you're used to constructing with WebGL, and project arbitrary 3D points onto your 2D screen.
n-dimensional boids simulation with modular behavior system
- nd
- 2d
- 3d
- acceleration
- align
- attractor
- behavior
- braitenberg
- boids
- constraint
- flocking
- follow
- force
- modular
- View more
Extended euclidian 2d geometry library for JavaScript with objects representing points, vectors, angles, transformations, transformation decompositions
simplify 2D polyline
A fast Poisson Disk sampling algorithm for random 2D points generation
Computes the convex hull of a given set of points using the Quick Hull algorithm.
chaikin's smoothing algorithm for 2D lines
- chaikin
- smooth
- polyline
- 2d
- polygon
- smoothing
- chaikin's
- smoother
- algorithm
- svg
- shape
- round
- subdivide
- points
- View more
Conversion and preparation of thi.ng/geom shapes & shape groups to/from AxiDraw pen plotter draw commands
Smoothing algorithm for 2D lines and polygons
Read a 2D coordinate grid from an ASCII-art-like string.
Maker.js, a Microsoft Garage project, is a JavaScript library for creating and sharing modular line drawings for CNC and laser cutters.
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.
chaikin's smoothing algorithm for any dimension lines
- chaikin
- smooth
- polyline
- 2d
- polygon
- smoothing
- chaikin's
- smoother
- algorithm
- svg
- shape
- round
- subdivide
- points
- View more
Small, typed, dependency free tool to round corners of 2d-polygon provided by an array of { x, y } points.
A function that takes two points on a 2D plane and returns the distance between them.
Find multiple virtual points as points in a matrix.
Draw perfect arrows between points or shapes