The Divide() method currently uses a sequential search for vertices to prevent duplicates.
It's possible to use a hash map instead in this case, using a pair of the vertices used to calculate the new one.
This would require a lot of re-factoring code, but should greatly speed up the loading time of the program.
The Divide() method currently uses a sequential search for vertices to prevent duplicates. It's possible to use a hash map instead in this case, using a pair of the vertices used to calculate the new one. This would require a lot of re-factoring code, but should greatly speed up the loading time of the program.