Abstract sphere-of-influence graphs
โ Scribed by Frank Harary; Michael S. Jacobson; Marc J. Lipman; F.R. McMorris
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 500 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The sphere-of-influence graph of a set of point sites in R a is constructed by identifying the nearest neighbor of each site, centering a ball at each site so that its nearest neighbor lies on the boundary, and joining two sites by an edge if and only if their balls intersect. The asymptotic behavio
We show that the variance of the number of edges in the random sphere of influence graph built on n i.i.d. sites which are uniformly distributed over the unit cube in R d , grows linearly with n. This is then used to establish a central limit theorem for the number of edges in the random sphere of i