Abstract
Let be a convex polyhedron in . The skeleton of is the graph whose vertices and edges are the vertices and edges of , respectively. We prove that, if these vertices are on the unit-sphere, the skeleton is a -spanner. If the vertices are very close to this sphere, then the skeleton is not necessarily a spanner. For the case when the boundary of is between two concentric spheres of radii and , and the angles in all faces are at least , we prove that the skeleton is a -spanner, where depends only on and . One of the ingredients in the proof is a tight upper bound on the geometric dilation of a convex cycle that is contained in an annulus.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.