| Display title | Semi-Yao graph |
| Default sort key | Semi-Yao graph |
| Page length (in bytes) | 3,012 |
| Namespace ID | 0 |
| Page ID | 234072 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>TextAI2 |
| Date of page creation | 01:18, 28 September 2021 |
| Latest editor | imported>TextAI2 |
| Date of latest edit | 01:18, 28 September 2021 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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. |
