Yao graph
id:
yao-graph-271-17777092
title:
Yao graph
text:
In computational geometry, the Yao graph, named after Andrew Yao, is a kind of geometric spanner, a weighted undirected graph connecting a set of geometric points with the property that, for every pair of points in the graph, their shortest path has a length that is within a constant factor of their Euclidean distance. The basic idea underlying the two-dimensional Yao graph is to surround each of the given points by equally spaced rays, partitioning the plane into sectors with equal angles, and
brand slug:
wiki
category slug:
encyclopedia
description:
Undirected graph with graph distances linearly bounded w.r.t. Euclidean distances
original url:
https://en.wikipedia.org/wiki/Yao_graph
date created:
date modified:
2019-02-18T18:27:04Z
main entity:
{"identifier":"Q8049052","url":"https://www.wikidata.org/entity/Q8049052"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/6/6b/Yao_graph.svg","width":800,"height":800}
fields total:
13
integrity:
15