我阅读了许多与此相关的文档,但找不到我要寻找的东西。
我想绘制两点之间的步行路径。是否可能?如果不是,是否有其他用于此目的的Python库?
我阅读了许多与此相关的文档,但找不到我要寻找的东西。
我想绘制两点之间的步行路径。是否可能?如果不是,是否有其他用于此目的的Python库?
当然可以。使用PolyLine
:
import folium
m = folium.Map(location=[40.720, -73.993],
zoom_start=15)
loc = [(40.720, -73.993),
(40.721, -73.996)]
folium.PolyLine(loc,
color='red',
weight=15,
opacity=0.8).add_to(m)
m
然后你将获得:
编辑1
为了在两点之间绘制步行路径,您可以使用OSMnx
和networkx
的组合:
import osmnx as ox
import networkx as nx
ox.config(log_console=True,
use_cache=True)
G_walk = ox.graph_from_place('Manhattan Island, New York City, New York, USA',
network_type='walk')
orig_node = ox.get_nearest_node(G_walk,
(40.748441, -73.985664))
dest_node = ox.get_nearest_node(G_walk,
(40.748441, -73.4))
route = nx.shortest_path(G_walk, orig_node, dest_node, weight='length')
fig, ax = ox.plot_graph_route(G_walk,
route,
node_size=0,
save=True,
file_format='svg',
filename='test')
然后你会得到:
编辑2
对于类似于folium的地图,您可以使用plot_route_folium
:
import osmnx as ox
import networkx as nx
ox.config(log_console=True, use_cache=True)
G_walk = ox.graph_from_place('Manhattan Island, New York City, New York, USA',
network_type='walk')
orig_node = ox.get_nearest_node(G_walk,
(40.748441, -73.985664))
dest_node = ox.get_nearest_node(G_walk,
(40.748441, -73.4))
route = nx.shortest_path(G_walk,
orig_node,
dest_node,
weight='length')
route_map = ox.plot_route_folium(G_walk, route)
route_map.save('route.html')
你会得到一个有用的HTML文件: