01:20 <GitHub> [solvespace] whitequark commented on issue #320: Yes, this is a known issue. https://github.com/solvespace/solvespace/issues/320#issuecomment-378793165

10:31 <GitHub> [solvespace] ghoss commented on issue #320: I did a proof-of-concept refactoring of the `InsertConvex`/`InsertConvexHow` combo, which replaces recursion with a queued approach and therefore mitigates the stack overflow problem to the heap, where it would be easier to detect and handle. This one is able to load my quick-and-dirty sphere models which crash the original code. The other functions are a bit harder to strai

11:16 <GitHub> [solvespace] whitequark commented on issue #320: I think @Evil-Spirit had a patch for this already too, I'll need to look around in the old repository. That said, thanks anyway, this might come in handy! https://github.com/solvespace/solvespace/issues/320#issuecomment-378901919

15:03 <GitHub> [solvespace] Evil-Spirit commented on issue #320: @whitequark, I have just optimized size of struct. I think @ghoss's patch can solve this problem in better way https://github.com/solvespace/solvespace/issues/320#issuecomment-378967954