Replaces the brittle crossing-based point-in-polygon (2D) algorithm b… #511
Job | Run time |
---|---|
4m 16s | |
4m 37s | |
4m 30s | |
4m 17s | |
2m 23s | |
8m 31s | |
5m 11s | |
6m 20s | |
6m 48s | |
2m 35s | |
4m 7s | |
3m 27s | |
1m 49s | |
6m 12s | |
6m 48s | |
6m 57s | |
6m 32s | |
2m 48s | |
1h 28m 8s |
Job | Run time |
---|---|
4m 16s | |
4m 37s | |
4m 30s | |
4m 17s | |
2m 23s | |
8m 31s | |
5m 11s | |
6m 20s | |
6m 48s | |
2m 35s | |
4m 7s | |
3m 27s | |
1m 49s | |
6m 12s | |
6m 48s | |
6m 57s | |
6m 32s | |
2m 48s | |
1h 28m 8s |