Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Shortest-path graph
open-in-new
<h2 id="properties-of-shortest-path-graph">Properties of shortest-path graph</h2> <p>When the configuration parameter <i>t</i> goes to infinity, shortest-path graph become the <a href="/facts/Minimum_spanning_tree/kgkGmY9s">minimum spanning tree</a> of the point set. The graph is a subgraph of the point set's <a href="/facts/Gabriel_graph/UYIRYo52">Gabriel graph</a> and therefore also a subgraph of its <a href="/facts/Delaunay_triangulation/6VRk7cS9">Delaunay triangulation</a>.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> </p> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>de Berg, Mark; Meulemans, Wouter; Speckmann, Bettina (2011). "Delineating imprecise regions via shortest-path graphs". Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '11. Vol. 19. pp. 271–280. doi:10.1145/2093973.2094010. ISBN 9781450310314. S2CID 2359926. Retrieved 2 September 2019. <a href="9781450310314" target="_blank">9781450310314</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>de Berg, Mark; Meulemans, Wouter; Speckmann, Bettina (2011). "Delineating imprecise regions via shortest-path graphs". Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '11. Vol. 19. pp. 271–280. doi:10.1145/2093973.2094010. ISBN 9781450310314. S2CID 2359926. Retrieved 2 September 2019. <a href="9781450310314" target="_blank">9781450310314</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> </ol>