The expected size of the sphere-of-influence graph

DOI10.1016/0925-7721(94)00025-QzbMath0838.68085OpenAlexW2075332242MaRDI QIDQ1903638

Rex A. Dwyer

Publication date: 1 February 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(94)00025-q

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ A strong law of large numbers for random biased connected graphs ⋮ A law of large numbers for nearest neighbour statistics ⋮ On the variance of the random sphere of influence graph ⋮ Sphere of influence graphs in general metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• The expected size of some graphs in computational geometry
• Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
• Sphere of influence graphs: Edge density and clique size
• Optimal Expected-Time Algorithms for Closest Point Problems
• A Problem on Circles

This page was built for publication: The expected size of the sphere-of-influence graph