ISAAC 2009: Algorithms and Computation pp 213-223 | Cite as
Geodesic Spanners on Polyhedral Surfaces
Abstract
In this paper we consider the problem of efficiently constructing geodesic t-spanners. We consider finding sparse spanners on the surface of a 3 dimensional polyhedron allowing for steiner vertices. If Steiner vertices are not allowed, then we establish lower bounds on the maximum node degree, depending on the spanning ratio t and also the total number of vertices of the polyhedron surface. We also consider the case of the surface of a convex polytope \(\mathcal P \) with V vertices. Using its vertex set P and Steiner points, we can construct a t-spanner with a constant degree and weight O(MST(U)), where MST(U) is the minimum spanning tree on the set U of vertices on convex polytope.
Keywords
Geodesic Distance Steiner Point Polyhedral Surface Dilation Factor Span RatioPreview
Unable to display preview. Download preview PDF.
References
- 1.Althofer, I., Das, G., Dopkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete and Computational Geometry 9, 81–100 (1993)CrossRefMathSciNetGoogle Scholar
- 2.Arya, S., Smid, M.: Efficient construction of a bounded degree spanner with low weight. Algorithmica 17, 33–54 (1997)MATHCrossRefMathSciNetGoogle Scholar
- 3.Chandra, B., Das, G., Narasimhan, G., Soares, J.: New sparseness results on graph spanners. International Journal of Computational Geometry and Applications 5, 125–144 (1995)MATHCrossRefMathSciNetGoogle Scholar
- 4.Dudley, R.: Metric entropy of some classes of sets with differentiable boundaries. J. Approximation Theory 10(3), 227–236 (1974)MATHCrossRefMathSciNetGoogle Scholar
- 5.Eppstein, D.: Spanning Trees and Spanners. In: Handbook of Computational Geometry, pp. 425–461. Elsevier Science, Amsterdam (1997)Google Scholar
- 6.Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Improved greedy algorithms for constructing sparse geometric spanners. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 314–327. Springer, Heidelberg (2000)CrossRefGoogle Scholar
- 7.Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Fast greedy algorithms for constructing sparse geometric spanners. SIAM Journal on Computing 31(5) (2002)Google Scholar
- 8.Karavelas, M.I., Guibas, L.J.: Static and kinetic geometric spanners with applications. In: Proceeding of the Twelfth Annual Symposium on Discrete algorithms, pp. 168–176 (2001)Google Scholar
- 9.Kortsarz, G., Peleg, D.: Generating low-degree 2-spanners. In: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms (2000)Google Scholar
- 10.Lanthier, M., Maheshwari, A., Sack, R.J.: Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica 30(4), 527–562 (2001)MATHCrossRefMathSciNetGoogle Scholar
- 11.Mitchell, J., Mount, D., Papadimitriou, C.: The discrete geodesic problem. SIAM Journal on Computing 16(4), 647–668 (1987)MATHCrossRefMathSciNetGoogle Scholar
- 12.Peleg, D., Schaffer, A.: Graph spanners. Journal of Graph Theory 13(1), 99–116 (1989)MATHCrossRefMathSciNetGoogle Scholar
- 13.Regev, H. The Weight of the Greedy Graph Spanner. Weizmann Institute of Science, Dept. of Applied Mathematics and Computer Science (1995)Google Scholar
- 14.Regev, H.: The weight of the greedy graph spanner. Tech. Rep. CS95-22, 1 (1995)Google Scholar