Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Semi-Yao graph

The k-semi-Yao graph (k-SYG) of a set of n objects P is a geometric proximity graph, which was first described to present a kinetic data structure… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
This paper introduces a new proximity graph, called the $k$-Semi-Yao graph ($k$-SYG), on a set $P$ of points in $\mathbb{R}^d… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
For a set of n points in the plane, this paper presents simple kinetic data structures (KDSs) for solutions to some fundamental… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
This paper presents a simple kinetic data structure for maintaining all the nearest neighbors of a set of $n$ moving points in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
This paper presents kinetic data structures (KDS’s) for maintaining the Semi-Yao graph, all the nearest neighbors, and all the (1… Expand
Is this relevant?