Bresenham's line algorithm in node. ES6 generators are supported! \o/
$ npm install bresenham
Calls fn with points between (x0, y0) and (x1, y1).
The points have integer coordinates.
If fn is omitted, an array of points is returned.
The algorithm uses no floating point arithmetics, so it's considered to be fast. But JS numbers are not integers, so I'm not sure whether this is a faster approach than the naive algorithm or not.
If you require('bresenham/generator'), you can use the generator API.
Creates a generator that yields every point between (x0, y0) and (x1, y1).
var line = bresenham(1, 2, 3, 4);
do {
var point = line.next().value;
// do something
} while(point);
MIT
FAQs
Bresenham's line algorithm
The npm package bresenham receives a total of 86,384 weekly downloads. As such, bresenham popularity was classified as popular.
We found that bresenham demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Research
The Socket Research Team breaks down a malicious wrapper package that uses obfuscation to harvest credentials and exfiltrate sensitive data.
Research
Security News
Attackers used a malicious npm package typosquatting a popular ESLint plugin to steal sensitive data, execute commands, and exploit developer systems.
Security News
The Ultralytics' PyPI Package was compromised four times in one weekend through GitHub Actions cache poisoning and failure to rotate previously compromised API tokens.