pvigier / mygal Goto Github PK

With reference to this line (also something similar at line 64 shortly after):

I wonder whether the free is out of place. From what my rusty memory tells me, it is supposed to be used only once and only on memory that has been previously allocated "the C way" (i.e. not with new but malloc/calloc). Looking at the initialization (root pointing the same as nil) it seems just something waiting to explode.

Hello Pierre,

I continue to experiment with your algorithm.
Now I'm trying to run it on some real data.

I have attached file with points.
When I read it, I have got segmentation fault during intersection stage.
Seems it is caused by duplicating points.
The matter is that halfEdge in do-while loop in intersect(Box box) method becomes a null pointer.
If I change condition to "while (halfEdge && halfEdge != site.face->outerComponent);" it goes to infinite loop until it hangs entire system.

If duplicates are removed, it works, but produces redundant (to my view) link crossing several zones in the middle:

Best Regards!
case.txt