RecursionError: maximum recursion depth exceeded in comparison about triangle_strip HOT 1 CLOSED

Hello, it seems that you tried to use the function for a rather big set of triangles. As stated in the module docstring:

    The performance and runtime of this solution is not optimal, but it is
    sufficient for small enough problems.

Since I am not actively developing the script, I can only suggest things, that might help you. As stated in my readme file I am open to any improvements for the code.

If you read the code, you will find out, that the algorithm tries out each combination of vertices recursively in order to find a possible solution. Thereby it is guided by a heuristic, that tries to minimize the 'usage' of each vertex.

For the whole process the script uses recursion. Your input seems to be big enough, that python reaches its maximum recursion depth, before finding a solution. Therefore you could:

• Increase the maximum recursion depth (https://docs.python.org/3/library/sys.html#sys.setrecursionlimit)
• Split your problem up into smaller problems and solve them independently
• Try to rewrite the solution to an iterative one

Note that no matter what, the runtime will be in general quite bad for solving the problem this way. Since it was sufficient for me (as I only had a small input) I did not take the time to investigate alternative solutions. Perhaps there are better ones out there.

I hope this helps you getting closer to a solution.

from triangle_strip.