On 31/07/2014 at 13:24, xxxxxxxx wrote:
If I have an object that has several groups of polygons that are disconnected from each other, they share no common points between each other. Is there a simple way to get how many different parts there and and what polygons compose each part? And still keep it as an object. I could only think of cycling through each polygon and finding it's neighbors as a way, but that seems a really slow way of doing it.