Given a set S of points in the plane and an angle 0 < θ ≤ 2π, the continuous Yao graph cY (θ) with vertex set S and angle θ defined as follows. For each p, q ∈ S, we add an edge from p to q in cY (θ) if there exists a cone with apex p and angular diameter θ such that q is the closest point to p inside this cone. In this paper, we prove that for 0 < θ 0, cY (θ) is not necessarily a self-approaching graph.
CITATION STYLE
Bakhshesh, D., & Farshi, M. (2016). Some properties of continuous yao graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9541, pp. 44–55). Springer Verlag. https://doi.org/10.1007/978-3-319-28678-5_4
Mendeley helps you to discover research relevant for your work.