Computing the offset edge intersections could be done in roughly O(log N) time (N is the number of edges) by using the Bentley-Ottmann algorithm. The current simple algorithm is O(N!)
Closing as wontfix. We can reopen once we want to do this.