I have identified a node id in osmnx graph (green point on the image). What I need is to create points that are exactly 5 kilometers from the identified node along the network path (yellow path). I have tried isochrones but they give all the nodes and not what I need.
Image Showing the Routes
Related
I am a student using osmnx to process some data. I have lat and long of a point somewhere on a road (it is sure that the point lies on a road), is there a way by which I can find the path distance between the nearest intersection and that point?
I have a set of origin-destination coordinates that I want to calculate the shortest paths between them.
My origin-destination coordinates are sometimes located in the middle of a long straight-line road. However, the shortest path calculated by OSMnx/networkx will not consider that mid-edge to nearest-node path.
Is there any ready function in OSMnx or networkx that I can use to find shortest path that originates/ends in the middle of the road?
If there is no such function, I am thinking of using the following steps.
Get nearest edges of origin and destination
Get nodes of those nearest edges: let's say (a,b) for origin, and (c,d) for destination
Calculate distance of 4 possible combinations: a->c, a->d, b->c, b->d
Project origin/destination onto their nearest edges: let's call them o1 and e1
Calculate distance o1->a, o1->b, e1->c, e1->d
Add (5) distance to (3): to get
o1->a->c->e1
o1->a->d->e1
o1->b->c->e1
o1->b->d->e1
Select path with smallest distance
OSMnx produces a networkx graph object for routing/analysis. As you note, networkx shortest path calculation takes an origin and a destination node, so trying to calculate a shortest graph path from an edge midpoint won't work.
A couple things you could try:
try to set simplify=False when you create the graph to retain as many nodes in the middle of streets as possible.
if that doesn't work, you could try to subdivide edges (with greater than some threshold length) into 50 meter chunks or somesuch to discretize them with more nodes.
See also: https://stackoverflow.com/a/55601732/7321942
I am trying to see if there is a plugin or Node library that will be able to estimate a lat/long based on an array of distances from known locations. Attached image shows three circles which are radius from known location. I would like to take this information and estimate a location from the combination of information. Originally I was thinking of just showing the intersect of the circles, but that does not cover cases where the circles do not intersect.
I´m new to QGIS, lately I got 2 Shapefiles one showing the polygons for some areas that represent street blocks, and another shapefile with the points that represent the number of comercial stores in the area, so sometimes we have one and others we have 90, depending on which street the survey was done.
The problem is that the points layer shows only one point where there should be more than one, that is because all points corresponding to a certain street or block are asigned the centroid of that polygon as coordinates. Is there a way to distribute all points automatically inside the polygons so if there is only one the points stays in the centroid and if there are more the points shift position in order to show how many points are exactly? Added a screencap for references
I have a matrix with ordinal numbers like below. I want to connected the nodes as you see in this picture. this is a directed graph. I have MATLAB 2015a. how can i draw graph like this and put it on my image with ?
as you see in the picture the node number one in (4,8) is should connected to the other node with directed graph. and node number2 should connect to other except node number 1 and so on( the node should connect to node with bigger number)
#Miki: thanks for your answer.(Check out this, or biograph)