Abstract
A Euclidean graph is a straight line embedding of a graph in the plane such that there is no crossing between any pair of edges and the length of an edge is the Euclidean distance between its two endpoints. A Euclidean chain C = (x 1,x 2,…, x n ) is a planar straight line graph with vertex set {x 1,x 2,…, x n } and edge set {x i x i + 1: 1 ≤ i ≤ n − 1}. Given a Euclidean chain C in the plane, we study the problem of finding a pair of points on C such that the new Euclidean graph obtained from C by adding a straight line segment (called shortcut) between this pair of points has the minimum diameter. We also study the ratio between the diameter of the new graph and the length of C. We give necessary and sufficient conditions for optimal shortcuts. We present three approximation algorithms for computing the optimal shortcuts of chains. One of them is a fully polynomial-time approximation scheme (FPTAS). We introduce two types of chains, strongly monotonic chain and simple chain. We provide properties for these two types of chains and their shortcuts.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C 28, 643–647 (1979)
Brown, K.Q.: Comments on Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C-30, 147–148 (1981)
Cai, L.: Personal communication
Gudmundsson, J., Haverkort, H., Park, S., Shin, C., Wolff, A.: Facility location and the geometric minimum-diameter spanning tree. Computational Geometry: Theory and Applications 27, 87–106 (2004)
Ho, J., Lee, D., Chang, C., Wong, C.: Minimum diameter spanning trees and related problems. SIAM Journal on Computing 20, 987–997 (1991)
Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Springer, Heidelberg (1985)
Spriggs, M., Keil, J.M., Bespamyatnikh, S., Segal, M., Snoeyink, J.: Computing a (1 + ε)-approximate geometric minimum-diameter spanning tree. Algorithmica 38, 577–589 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, B. (2011). Euclidean Chains and Their Shortcuts. In: Wang, W., Zhu, X., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2011. Lecture Notes in Computer Science, vol 6831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22616-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-22616-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22615-1
Online ISBN: 978-3-642-22616-8
eBook Packages: Computer ScienceComputer Science (R0)