SaaSHub helps you find the best software and product alternatives Learn more →
Top 18 Triangulation Open-Source Projects
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
JTS Topology Suite
The JTS Topology Suite is a Java library for creating and manipulating vector geometry.
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
Computational-geometry
Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc
-
LibTessDotNet
C# port of the famous GLU Tessellator - prebuilt binaries now available in "releases" tab
-
Delaunator-GDScript
A GDScript port of Delaunator: A fast library for Delaunay triangulation of 2D points.
-
triangolatte
2D triangulation library. Allows translating lines and polygons (both based on points) to the language of GPUs.
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
Project mention: Using Voronoi polygons for simplified continent generation | /r/proceduralgeneration | 2023-05-05Well, 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.
Project mention: Using Voronoi polygons for simplified continent generation | /r/proceduralgeneration | 2023-05-05Well, 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.
Triangulation related posts
- Using Voronoi polygons for simplified continent generation
- poly2tri-rs, an idiomatic and fast rust lib(port) for triangulation
- Algorithm that covers a whole area with points, with values based on the original points at each iteration.
- Visualizing Delaunay Triangulation
- Copilot just sells code other people wrote
- Any algorithm to have many evenly placed triangles for this mesh?
- How can I get started with terrain generation on Spherical objects?
-
A note from our sponsor - SaaSHub
www.saashub.com | 24 Apr 2024
Index
What are some of the best open-source Triangulation projects? This list will help you:
Project | Stars | |
---|---|---|
1 | CGal | 4,534 |
2 | delaunator | 2,195 |
3 | earcut | 2,101 |
4 | triangle | 2,028 |
5 | JTS Topology Suite | 1,856 |
6 | Laser_control | 1,221 |
7 | pmp-library | 1,202 |
8 | Computational-geometry | 1,139 |
9 | earcut.hpp | 808 |
10 | poly2tri | 414 |
11 | delaunator-sharp | 364 |
12 | LibTessDotNet | 295 |
13 | SnakeStrike | 86 |
14 | Delaunator-GDScript | 79 |
15 | t-pose | 40 |
16 | triangolatte | 36 |
17 | Delaunay | 1 |
18 | triangulate | 1 |
Sponsored