I’m implementing a very experimental routing algorithm using GraphHopper. Part of the algorithm requires getting a list of edges from the graph and restricting this list for use later. The restriction phase requires some expensive computation so fetching ALL edges from the graph and pruning takes way too long (My graph has over 1 million edges!)
Is there some spatial index way of fetching edges from the graph? Ideally I would like a list of all edges that are entirely contained inside of a specified ellipse. Any help would be appreciated.