Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEAInteresting challenge - especially optimising runtime. My solution ran in ~18 seconds
Based on the length of diagonals of squares and the fact that Centroids are used instead of Grid polygons, I could reasonably speed up this workflow to 16.6 seconds. It's just the sampling where I used an arbitrary value.
Solution attached.
Within 95.6 meters of Ned in 9.7 seconds. First I had NO clue how to approach this, started splitting all roads into their separate segments using poly split and then multi-row-formula, then calculating distances. Figured that a the point halfway the longest distance that did not intersect any segment would be the solution. However, after 55 minutes, my flow still had not finished (cartesian product, all segments to all segments).
So I looked at the first few spoilers...
QUESTION: how did you guys manage to make a grid smaller than 1 mile/kilometer?? My grid tool does not accept 0.1 or 0,1 values...
Regards, Arjan