earcut
delaunator
| earcut | delaunator | |
|---|---|---|
| 2 | 4 | |
| 2,101 | 2,199 | |
| 1.0% | 2.0% | |
| 0.0 | 4.9 | |
| 9 months ago | 3 months ago | |
| JavaScript | JavaScript | |
| ISC License | ISC 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.
earcut
-
Looking for a modern way to draw filled polygons outta polyline-loop
To OP, you might want to check out https://github.com/mapbox/earcut. There are ports of it to all sorts of languages and it will help you with the triangulation.
- Function for generating and filling polygon from set of points
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
What are some alternatives?
turf - A modular geospatial engine written in JavaScript and TypeScript
blog - Life is a moment :notebook_with_decorative_cover:
Delaunator-GDScript - A GDScript port of Delaunator: A fast library for Delaunay triangulation of 2D points.
earcut.hpp - Fast, header-only polygon triangulation
fdir - ⚡ The fastest directory crawler & globbing library for NodeJS. Crawls 1m files in < 1s
rbush - RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
javascript-algorithms - 📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings
spine-runtimes - 2D skeletal animation runtimes for Spine.
delaunator-sharp - Fast Delaunay triangulation of 2D points implemented in C#.
unity-delaunay - A Delaunay/Voronoi library for Unity, and a simple destruction effect