Skip to content
Commit 1d52fbaf authored by Volker Krause's avatar Volker Krause
Browse files

Implement nodes merging in O(nlogn) rather than O(n²logn) 

Sorted insertion is quite expensive, and it gets worse the more tiles we
merge. Gives us another 70% speedup.
parent d103b661
Pipeline #377490 passed with stage
in 4 minutes and 12 seconds
Hide whitespace changes
Inline Side-by-side
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment