Greedy geometric spanner
id:
greedy-geometric-spanner-287-1897371
title:
Greedy geometric spanner
text:
In computational geometry, a greedy geometric spanner is an undirected graph whose distances approximate the Euclidean distances among a finite set of points in a Euclidean space. The vertices of the graph represent these points. The edges of the spanner are selected by a greedy algorithm that includes an edge whenever its two endpoints are not connected by a short path of shorter edges. The greedy spanner was first described in the PhD thesis of Gautam Das and conference paper and subsequent jo
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Greedy_geometric_spanner
date created:
date modified:
2024-01-11T08:27:58Z
main entity:
{"identifier":"Q60792215","url":"https://www.wikidata.org/entity/Q60792215"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/0f/Greedy_geometric_spanner_2.svg","width":600,"height":600}
fields total:
13
integrity:
14