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)

(More)

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)

Is this relevant?

2014

2014

- Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides
- ArXiv
- 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)

Is this relevant?

2014

2014

- Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides
- CCCG
- 2014

This paper presents kinetic data structures (KDS’s) for maintaining the Semi-Yao graph, all the nearest neighbors, and all the (1… (More)

Is this relevant?

2014

2014

- André van Renssen
- CCCG
- 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

- Luis Barba, Prosenjit Bose, +5 authors Sander Verdonschot
- CCCG
- 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)

Is this relevant?

2013

2013

- Wah Loon Keng, Ge Xia
- ArXiv
- 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)

Is this relevant?

2012

2012

- Prosenjit Bose, Mirela Damian, +4 authors Stefanie Wuhrer
- Int. J. Comput. Geometry Appl.
- 2012

We show that the Yao graph Y4 in the L2 metric is a spanner with stretch factor 8 √ 2(29 + 23 √ 2).

Is this relevant?

Review

2010

Review

2010

- Joseph O'Rourke
- ArXiv
- 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)

Is this relevant?

2010

2010

- Mirela Damian, Kristin Raudonis
- COCOA
- 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)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Xiang-Yang Li, Peng-Jun Wan, Yu Wang, Ophir Frieder
- HICSS
- 2002

We consider how to construct power efficient wireless ad hoc networks. We propose two different methods combining several well… (More)

Is this relevant?