Abstract
In this paper, we consider Hamiltonian cycles of vertices in convex position on the plane, where, in general, these cycles contain crossing edges. We give several results concerning the minimum number of operations that delete two crossing edges, add two other edges and preserve hamiltonicity in transforming these cycles to non-crossing Hamiltonian cycles.
This is a preview of subscription content, log in via an institution to check access.
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
Burkard, R. E., Deǐneko, V. G., van Dal, R., van der Veen J. A. A., Woeginger, G. J.: Well-Solvable Special Cases of the TSP: A Survey. SIAM Review, 40, 496–546 (1998)
Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (Extended Abstract). In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2007)
Hagita, M., Oda, Y., Ota, K.: The diameters of some transition graphs constructed from Hamilton cycles. Graphs Combin. 18, 105–117 (2002)
Ito, H., Uehara, H., Yokoyama, M.: Lengths of tours and permutations on a vertex set of a convex polygon. Discrete Appl. Math. 115, 63–72 (2001)
Ito, H.: Three equivalent partial orders on graphs with real edge-weights drawn on a convex polygon. In: Akiyama, J., Kano, M., Tan, X. (eds.) JCDCG 2004. LNCS, vol. 3742, pp. 123–130. Springer, Heidelberg (2005)
Kabadi, S.N.: Polynomially solvable cases of the TSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, pp. 489–583. Kluwer Academic Publishers, Dordrecht (2002)
van Leeuwen, J., Schoone, A.A.: Untangling a traveling salesman tour in the plane. Technical report, University of Utrecht, Report No. RUUCS-80-11 (1980)
Pach, J., Tardos, G.: Untangling a polygon. Discrete Comput. Geom. 28, 585–592 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oda, Y., Watanabe, M. (2008). The Number of Flips Required to Obtain Non-crossing Convex Cycles. In: Ito, H., Kano, M., Katoh, N., Uno, Y. (eds) Computational Geometry and Graph Theory. KyotoCGGT 2007. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89550-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-89550-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89549-7
Online ISBN: 978-3-540-89550-3
eBook Packages: Computer ScienceComputer Science (R0)