I have programmed a triangle-triangle intersection algorithm, which have I have successfully tested for all distinctly different situations I could think of. I did this by manually inspecting all these situations using an online visualisation tool.
To be certain there are no bugs in the code, I would now like to test more comprehensively. My plan is to run an automated test for every possible configuration in a 100x100x100 grid in 3D space. Thus I either need a list with these coordinates and whether there is an intersection or not, or I need another algorithm that I can trust to produce the correct results.