出典:Wiktionary
出典:Wikipedia
出典:『Wikipedia』 (2011/06/27 18:38 UTC 版)
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.