Geodesic Paths

Calculates the geodesic path between two vertices using Dijkstra’s algorithm

from __future__ import annotations

import pyvista as pv
from pyvista import examples

# Load a global topography surface and decimate it
land = examples.download_topo_land().triangulate().decimate(0.98)

Get the geodesic path as a new pyvista.PolyData object:

cape_town = land.find_closest_point((0.790801, 0.264598, -0.551942))
dubai = land.find_closest_point((0.512642, 0.745898, 0.425255))
bangkok = land.find_closest_point((-0.177077, 0.955419, 0.236273))
rome = land.find_closest_point((0.718047, 0.163038, 0.676684))

a = land.geodesic(cape_town, dubai)
b = land.geodesic(cape_town, bangkok)
c = land.geodesic(cape_town, rome)

Render the path along the land surface

pl = pv.Plotter()
pl.add_mesh(a + b + c, line_width=10, color='red', label='Geodesic Path')
pl.add_mesh(land, show_edges=True)
pl.add_legend()
pl.camera_position = pv.CameraPosition(
    position=(3.5839785524183934, 2.3915238111304924, 1.3993738227478327),
    focal_point=(-0.06842917033182638, 0.15467201157962263, -0.07331693636555875),
    viewup=(-0.34851770951584765, -0.04724188391065845, 0.9361108965066047),
)

pl.show()

Static Scene

Interactive Scene

How long is that path?

distance = land.geodesic_distance(cape_town, rome)
distance

np.float64(1.9943788383876464)

Tags: filter