Yao graph

In computational geometry, the Yao graph, named after Andrew Yao, is a kind of geometric spanner, a weighted undirected graph connecting a set of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2000-2017
0246820002017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
It is an open problem whether Yao-Yao graphs YYk (also known as sparse-Yao graphs) are all spanners when the integer parameter k… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
This paper introduces a new proximity graph, called the k-Semi-Yao graph (k-SYG), on a set P of points in R, which is a… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
This paper presents kinetic data structures (KDS’s) for maintaining the Semi-Yao graph, all the nearest neighbors, and all the (1… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
We present upper bounds on the spanning ratio of constrained Yao-graphs with at least 7 cones. Given a set of points in the plane… (More)
Is this relevant?
2014
2014
In this paper, we introduce a variation of the wellstudied Yao graphs. Given a set of points S ⊂ R and an angle 0 < θ ≤ 2π, we… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2013
2013
In this paper we prove that Y5, the Yao graph with five cones, is a spanner with stretch factor ρ = 2 + √ 3 ≈ 3.74. Since Y5 is… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
We show that the Yao graph Y4 in the L2 metric is a spanner with stretch factor 8 √ 2(29 + 23 √ 2). 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2010
Review
2010
We prove that Y6 is a spanner. Y6 is the Yao graph on a set of planar points, which has an edge from each point x to a closest… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Yao and Theta graphs are defined for a given point set and a fixed integer k > 0. The space around each point is divided into k… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider how to construct power efficient wireless ad hoc networks. We propose two different methods combining several well… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?