Skip to search form
Skip to main content
>
Semantic Scholar
Semantic Scholar's Logo
Search
Sign In
Create Free Account
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
Create Alert
Alert
Related topics
Related topics
6 relations
Broader (1)
Computational geometry
Delaunay triangulation
Geometric spanner
Kinetic data structure
Theta graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Kinetic $k$-Semi-Yao Graph and its Applications
Zahed Rahmati
,
Mohammad Ali Abam
,
V. King
,
S. Whitesides
Comput. Geom.
2019
Corpus ID: 15527391
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
2015
2015
A simple, faster method for kinetic proximity problems
Zahed Rahmati
,
Mohammad Ali Abam
,
V. King
,
S. Whitesides
,
Alireza Zarei
Comput. Geom.
2015
Corpus ID: 18971251
For a set of n points in the plane, this paper presents simple kinetic data structures (KDSs) for solutions to some fundamental…
Expand
2014
2014
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d
Zahed Rahmati
,
Mohammad Ali Abam
,
V. King
,
S. Whitesides
CCCG
2014
Corpus ID: 15122505
This paper presents a simple kinetic data structure for maintaining all the nearest neighbors of a set of $n$ moving points in…
Expand
2013
2013
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\mathbb{R}^d$
Zahed Rahmati
,
Mohammad Ali Abam
ArXiv
2013
Corpus ID: 30614549
This paper presents kinetic data structures (KDS’s) for maintaining the Semi-Yao graph, all the nearest neighbors, and all the (1…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE