Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper presents a simple kinetic data structure for maintaining all the nearest neighbors of a set of $n$ moving points in… 
2013
2013
This paper presents kinetic data structures (KDS’s) for maintaining the Semi-Yao graph, all the nearest neighbors, and all the (1…