Delaunator-GDScript
delaunator
Delaunator-GDScript | delaunator | |
---|---|---|
2 | 4 | |
79 | 2,214 | |
- | 1.4% | |
0.0 | 4.9 | |
about 2 months ago | 4 months ago | |
GDScript | JavaScript | |
MIT 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.
Delaunator-GDScript
-
How can I get started with terrain generation on Spherical objects?
Alternatively, if you do want to play with the delaunay/voronoi sphere, I would recommend giving yourself a week to play with delaunay/voronoi on a plane first, using Delaunator-GDScript. It takes some getting used to. I think I spent three weeks on just the geometry (in Delaunator-Javascript) before attempting terrain generation. Then you'll be able to wrap it onto a sphere. The good news is that most of the hard work is getting it working on a plane, and then the sphere is not much more work.
-
Creating a glass destruction transition using Delaunator-GDScript and Godot
I whilst searching for how to create destructible objects in Godot, I found Delaunator-GDScript I used it to create the really nice transition shown above. I'll show you how to create it in this. First download Delaunator.gd from the repository and place it in your project folder. Create a new Singleton with a Canvas Layer as it's root node , then add a script to it.
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?
earcut - The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
godot-3-demos - Dozens of free and open source demos for the Godot game engine, version 3. Head to the link below for newer demos for Godot 4+
blog - Life is a moment :notebook_with_decorative_cover:
CavalierContours - 2D polyline library for offsetting, combining, etc.
turf - A modular geospatial engine written in JavaScript and TypeScript
surfacer - AI and pathfinding for 2D-platformers in Godot.
fdir - ⚡ The fastest directory crawler & globbing library for NodeJS. Crawls 1m files in < 1s