Christian S Posted October 7, 2014 Share Posted October 7, 2014 Hi, What would be the best way to find and clean self-intersecting polygon surfaces? In the attached images, you can see exactly what I'm writing about. I tried a few standard nodes but could not find what I was looking for. Next stop for me would be to code it in Python but I don't like the speed of it. I wonder if there is a more elegant approach... Thx! C Quote Link to comment Share on other sites More sharing options...
kgoossens Posted October 7, 2014 Share Posted October 7, 2014 Have you tried using traingulate2d? Quote Link to comment Share on other sites More sharing options...
kgoossens Posted October 7, 2014 Share Posted October 7, 2014 I've added a small example. SelfIntersection.hipnc Quote Link to comment Share on other sites More sharing options...
Christian S Posted October 7, 2014 Author Share Posted October 7, 2014 Triangulate2D did the trick! Thank you so much for this Kim Much appreciated. C Quote Link to comment Share on other sites More sharing options...
ChristianSirois-GoogleChrome.jpg.a228044b6cd2e012efcde0dd49940e0c.thumb.jpg.e2b7b5454974ab34cfc9980b8c517f4d.jpg)
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.