Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Shortest-path graph
open-in-new
<p>In <a href="/facts/Mathematics/pxTouaz4">mathematics</a> and <a href="/facts/Geographic_information_science/tcKLAvuw">geographic information science</a>, a shortest-path graph is an <a href="/facts/Undirected_graph/kw3eIBUe">undirected graph</a> defined from a set of points in the <a href="/facts/Euclidean_plane/tAUtRFcn">Euclidean plane</a>. The shortest-path graph is proposed with the idea of inferring edges between a point set such that the shortest path taken over the inferred edges will roughly align with the shortest path taken over the imprecise region represented by the point set. The edge set of the shortest-path graph varies based on a single parameter <i>t</i> ≥ 1. When the weight of an edge is defined as its Euclidean length raised to the power of the parameter <i>t</i> ≥ 1, the edge is present in the shortest-path graph if and only if it is the least weight path between its endpoints. </p>