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 for maintenance of all the nearest neighbors on moving objects. It is named for its relation to the Yao graph, which is named after Andrew Yao.
Contents
Construction
The k-SYG is constructed as follows. The space around each point p in P is partitioned into a set of polyhedral cones of opening angle
Properties
References
Semi-Yao graph Wikipedia(Text) CC BY-SA