4 ms·
This is mainly about getting getting the correct roads data, but I would be more interested in the algorithmic question: given a roads network, how do you find
by ks2048 4y ago
This is mainly about getting getting the correct roads data, but I would be more interested in the algorithmic question: given a roads network, how do you find the longest line not crossing a road?
The linked blog post mentioned they "calculated the areas of all the polygons to identify the largest ones". Just drawing some lines on a plane, there are not necessarily any polygons. And they say start and end points must be on vertices, but I'm not sure why. So it's not very clear.
- OscarCunningham 4y agoThis paper https://arxiv.org/abs/1804.07389# https://arxiv.org/abs/1804.07389# uses an algorithm called 'branch-and-bound'.