mikolalysenko/l1-path-finder

🗺 Fast path planning for 2D grids

JavaScript

508

MIT License

l1-path-finder is a fast path planning library for 2D grids that uses advanced algorithms to find shortest paths through obstacles. It's designed for developers building games, robotics applications, or any system that needs efficient pathfinding on grid-based maps.

Total donated

Undistributed

Share with your subscribers:

Recipients

How the donated funds are distributed

Support the dependencies of mikolalysenko/l1-path-finder

mikolalysenko/binary-search-bounds

Better binary searching

mikolalysenko/contour2d

Extracts the boundary of a binary 2D image

mikolalysenko/ndarray

Multidimensional Arrays

mikolalysenko/ndarray-ops

Common operations for ndarray arrays

mikolalysenko/ndarray-prefix-sum

Computes a prefix sum of an ndarray

mikolalysenko/robust-orientation

Exactly computes the orientation of a tuple of points

mikolalysenko/uniq

Removes duplicates from a sorted array in place

jansegre/astar-andrea

Andrea Giammarchi's path finder with A* (A star).

mikolalysenko/bitmap-to-boxes

Partitions a 2D binary image into rectangles

bpostlethwaite/colormap

Great looking color maps

prettymuchbryce/easystarjs

Asynchronous A* Pathfinding API

mikolalysenko/mouse-change

Mouse state change listener

mikolalysenko/ndarray-imshow

Displays an ndarray as an image

mikolalysenko/ndarray-unpack

Converts an ndarray into an array-of-arrays

maxogden/nets

nothin but nets. http client that works in node and browsers

yi/node-path-finding

a Node.JS implementation for AStar path finding algorithm. This implementation uses primitive data types (Number and Byte/Buffer) to present location and block data that significantly improve the speed and have a good control on memory consumption

mikolalysenko/parse-grid-bench

Parses grid path finding benchmark data