I'd like to announce a repository I'm working on and invite people to contribute.
It is about Delaunay Triangulation and Refinement. My goal is to implement a 3D tetrahedralization and refinement, targeting WebAssembly in the future. Up until now, the repository is about to be published to CratesIO and a proper API is missing.
I do expect to find hard problems and to succeed solving them. If you are interested in this implementation and wanna join, I hopefully expect we may have a nice development experience together.
The link to the repository is https://github.com/nelsonatgithub/nlsn-delaunay-refine
Delaunay triangulation is a special triangulation, where the circumcircle of any triangle in the triangulation does not contain any vertex in its interior. L’idée was proposed in 1934 by Boris Delaunay in his paper Sur la Sphère Vide [B. Delaunay, Sur la sphère vide. A la mémoire de Georges Voronoi, Bulletin de l’Académie des Sciences de l’URSS. Classe des sciences mathématiques et naturelles, 1934, no. 6, 793–800.]. The triangulation’s emptiness property maximizes the smallest interior angle of the triangles in the triangulation and has important applications to several areas, including mesh generation.
How to Contribute
The first thing to do is to clone the repository, with a cargo environment. Fork it if you want. Run the tests. Then read the code.
Open an issue with suggestions, code reviews, refactoring.
As the repository is at initial state of development, the code is mostly under naive implementation. I'd ask as many suggestions and opinions as possible. I hopefully expect this to be a great experience to everyone.
I'm just new in this forum. I've been learning Rust for about 1 year. And a few months ago, I've decided to put this knowledge into practice and create an open source library. Now I've got an interesting implementation of an algorithm of my choice to share.