How to greedy mesh?

I want to make a greedy meshing algorithm but i dont know how. I have a table with all the parts X and Z coordinates e.g

[-1] = {[-1] = part,[0] = part, [1] = part},
[0] = {[-1] = part,[0] = part, [1] = part},
[1] = {[-1] = part,[0] = part, [1] = part},

Now i want the algorithm to see that there is a part next to another part and then CONSUME it. If you want more help feel free to ask me.

1 Like

Hi! I don’t know much about greedy meshing but maybe this post from Elttob will help?

thank you for the help but that post i saw earlier is absolutely useless to me. sorry

1 Like

This topic was automatically closed 14 days after the last reply. New replies are no longer allowed.