on the stretch factor of convex delaunay graphs
Clicks: 156
ID: 185053
2010
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
30.0
/100
156 views
34 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #15 of 19 articles by views in canadian journal of infectious diseases and medical microbiology
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S) of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that DGC(S) is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, for any two points p and q in S, the graph DGC(S) contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.
| Reference Key |
bose2010journalon
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Prosenjit Bose;Paz Carmi;Sebastien Collette;Michiel Smid |
| Journal | canadian journal of infectious diseases and medical microbiology |
| Year | 2010 |
| DOI |
10.20382/jocg.v1i1a4
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.