3 ms·
Nice! If I re-engineered your algorithm correctly, it tries to find the single largest circle within a grid of streets. This, unfortunately doesn't work well
by cnj 7y ago
Nice!
If I re-engineered your algorithm correctly, it tries to find the single largest circle within a grid of streets.
This, unfortunately doesn't work well for a river that isn't frequently broken up by bridges.
E.g. the whole area of Treptower Park, Insel der Jugend, Stralau and Rummelsburger Bucht doesn't have a Rueckzugsort next to the water (there is only a big one in Plaenterwald for that whole part of the Spree).
Nice work, though. I'd be interested in a version of this that maximizes walking or biking time without crossing streets!
- anc84 7y agoIt's a cheap and hand-wavy, yet titled impressively piece made by an artist so don't expect anything too sophisticated ;)
- terminalhealth 7y agoWorking with circles seems weird. I would have computed a Voronoi tessellation with Fortune's algorithm (also n log n) and colored the result with OpenGL triangles. Even better would be to estimate traffic density of the roads based on road type and some measure of centricity/connectedness and also weight the resulting values with that. A small central spot sourrounded by small streets may be calmer than a large peripheral one right next to a high way.