delaunator
javascript-algorithms
delaunator | javascript-algorithms | |
---|---|---|
4 | 118 | |
2,199 | 182,797 | |
0.8% | - | |
4.9 | 5.0 | |
3 months ago | 15 days ago | |
JavaScript | JavaScript | |
ISC License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
delaunator
-
Using Voronoi polygons for simplified continent generation
Well, the easiest option would probably be to use a different Delaunay/Voronoi library. Delaunator (C# bindings here) should be a pretty good option: it's fast, and there's a good explanation of how to use the data structures it generates. There is some weirdness with how points at the edge of the domain work that you may have to work around, but that will probably be easier than trying to modify another algorithm or write your own. I know I've struggled to implement the algorithms for calculating Voronoi diagrams/Delaunay triangulations, even though I feel like I have a decent high-level understanding of how Fortune's algorithm is supposed to work.
- Question about ints used for enums (cast as enum) (4.0.2)
-
Visualizing Delaunay Triangulation
Great article!
How does this algorithm compare to others, e.g. sweep algorithms like the one used by delaunator[0]?
An obvious difference is sweep algorithms sort the points in some way before adding them, is that a key to efficiency gains?
0: https://github.com/mapbox/delaunator/blob/main/README.md#pap...
- Diamonds
javascript-algorithms
- 10 GitHub Repos for Mastering JavaScript
-
Minecraft Grub Theme
I'm reminded of the time when some kid wrote a script to crawl GitHub and create issues[1] about using inclusive language... except it was really dumb, for example: https://github.com/trekhleb/javascript-algorithms/pull/875/f...
[1] E.g.: https://github.com/EbookFoundation/free-programming-books/pu...
-
is there any website that you can practise javascript from complete beginning to mastery
Try codewars or leetcode Or you can use this repo for ds practice https://github.com/trekhleb/javascript-algorithms
-
Is anyone interested in contributing to Ultimate Guide to Algorithm opensource together?
This one is pretty popular too.
-
Help! Prep for interview in 2 weeks
for algos - not sure how much you'll need to do for a jr position but familiarity with some of the beginner stuff here couldn't hurt: https://github.com/trekhleb/javascript-algorithms
-
JavaScript-algorithms: Algorithms and data structures implemented in JavaScript
Traditionally, a linked list allows you to insert before/after a node. i.e. addBefore(node,value) (see [2] ) He doesn't implement addBefore & addAfter.
Instead, he provides a whole bunch of non-canonical helpers like reverse(), toArray(), deleteTail() etc - these are typical LC-Easy problems that don't belong inside the data structure.
My own introduction to these things was a C course called "Data Structures in C" in the traditional CS curriculum, and yes, you would have to malloc a new node, get back a pointer with a memory address, & the process of pointing the next pointer of the current node to this new node so that the memory address of the next value was explicitly "linked" to the current value and hence linked list etc...I guess much of that terminology is lost on the new generation in the absence of pointers & memory addresses.
The canonical exercise in those days was - Show that a linked list does not store objects in contiguous memory, unlike an array. So to solve this, you would traverse the list from the head node & print the actual addresses of the memory locations along the way, proving that the vals aren't stored contiguously. I wonder what that exercise would mean in JS land.
That said, yeah its a good starting point & I applaud the effort.
[1]https://github.com/trekhleb/javascript-algorithms/blob/maste...
- 30 March 2023 - Daily Chat Thread
What are some alternatives?
earcut - The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Dlib - A toolkit for making real world machine learning and data analysis applications in C++
blog - Life is a moment :notebook_with_decorative_cover:
javascript-es2020-sandbox - This is a place for me to screw around some code and will be the home of my future JavaScript ES2020 Cheat Sheet
turf - A modular geospatial engine written in JavaScript and TypeScript
developer-roadmap - Interactive roadmaps, guides and other educational content to help developers grow in their careers.
fdir - ⚡ The fastest directory crawler & globbing library for NodeJS. Crawls 1m files in < 1s
clean-code-javascript - :bathtub: Clean Code concepts adapted for JavaScript
spine-runtimes - 2D skeletal animation runtimes for Spine.
free-for-dev - A list of SaaS, PaaS and IaaS offerings that have free tiers of interest to devops and infradev
delaunator-sharp - Fast Delaunay triangulation of 2D points implemented in C#.
You-Dont-Know-JS - A book series on JavaScript. @YDKJS on twitter.