The expected size of some graphs in computational geometry
From MaRDI portal
Publication:1106021
DOI10.1016/0898-1221(88)90071-5zbMath0649.68066OpenAlexW2051522939MaRDI QIDQ1106021
Publication date: 1988
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90071-5
expectationsgeometric graphsprobability distributionscomputational geometryGabriel graphasymptotic lower bounds
Related Items
Weak laws of large numbers in geometric probability, PROXIMITY GRAPHS: E, δ, Δ, χ AND ω, On nearest-neighbor graphs, The expected size of the sphere-of-influence graph, GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING, Intersections with random geometric objects, Normal approximation in total variation for statistics in geometric probability, Convergence rate for geometric statistics of point processes having fast decay of dependence, On Azadkia-Chatterjee's conditional dependence coefficient, Connected spatial networks over random points and a route-length statistic, Coloring certain proximity graphs, Local solutions for global problems in wireless networks, On the expected maximum degree of Gabriel and Yao graphs, Bounds to the normal for proximity region graphs, The \(\gamma\)-neighborhood graph, Distribution-sensitive construction of the greedy spanner, On the number of higher order Delaunay triangulations, On the variance of the random sphere of influence graph, The expected number of \(k\)-faces of a Voronoi diagram
Cites Work
- The relative neighbourhood graph of a finite planar set
- On the equivalence of some rectangle problems
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- Algorithms for Reporting and Counting Geometric Intersections
- Direct dominance of points
- An improved algorithm for the rectangle enclosure problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
