Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create trimesh from non-convex 2D polygons #59

Closed
EmbersArc opened this issue Oct 23, 2021 · 0 comments · Fixed by #60
Closed

Create trimesh from non-convex 2D polygons #59

EmbersArc opened this issue Oct 23, 2021 · 0 comments · Fixed by #60

Comments

@EmbersArc
Copy link
Contributor

I'd like to be able to create a TriMesh from non-convex 2D polygons.

I have a PR ready implementing the ear-clipping algorithm. Once we have this, we can think about adding the Hertel-Mehlhorn algorithm that combines the triangles into convex polygons again, to give a good convex decomposition.

The reason for this is that, at least in my experiments, the VHACD algorithm is orders of magnitude slower than this method.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant