On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
DOI10.1137/S0895480197318088zbMATH Open1115.68107OpenAlexW2039111454MaRDI QIDQ3440264FDOQ3440264
Authors: Prosenjit Bose, Luc Devroye, W. Evans, David Kirkpatrick 
Publication date: 22 May 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480197318088
Recommendations
computational geometryprobabilistic analysisGabriel graphspannersgeometric spanners\(\beta\)-skeletonsproximity graphs
Geometric probability and stochastic geometry (60D05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (17)
- Proximity structures for geometric graphs
- Hardness results for computing optimal locally Gabriel graphs
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
- (1 + εΒ) -spanner constructions for general graphs
- On a family of strong geometric spanners that admit local routing strategies
- The \(\gamma\)-neighborhood graph
- Empty region graphs
- Characterizing proximity trees
- Efficient Computation of Elliptic Gabriel Graph
- Sigma-local graphs
- Connected spatial networks over random points and a route-length statistic
- On the expected maximum degree of Gabriel and Yao graphs
- On growing connected \(\beta \)-skeletons
- On plane geometric spanners: a survey and open problems
- Title not available (Why is that?)
- 10-Gabriel graphs are Hamiltonian
- Distribution-sensitive construction of the greedy spanner
This page was built for publication: On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440264)
