Abstract
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n 2) “moves” between simple polygons. Each move is composed of a sequence of atomic moves called “stretches” and “twangs,” which walk between weakly simple “polygonal wraps” of S. These moves show promise to serve as a basis for generating random polygons.
Similar content being viewed by others
References
Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proc. 8th Canad. Conf. Comput. Geom., pp. 38–43 (1996)
Bao, D.D.-W., Bao, D.: Sampler of Riemann-Finsler Geometry. Cambridge University Press, Cambridge (2004)
Bose, P., Hurtado, F.: Flips in planar graphs. Comput. Geom. Theory. Appl. 42, 60–81 (2009)
Czyzowicz, J., Hurtado, F., Urrutia, J., Zaguia, N.: On polygons enclosing point sets. Geombinatorics XI, 21–28 (2001)
Damian, M., Flatland, R., O’Rourke, J., Ramaswami, S.: Connecting polygonizations via stretches and twangs. In: Proc. 25th Sympos. Theoretical Aspects Comput. Sci. (STACS), IBFI Schloss Dagstuhl, pp. 217–228 (2008)
García, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of K N . Comput. Geom. Theory Appl. 16, 211–221 (2000)
Hernando, C., Hurtado, F., Houle, M.: On local transformation of polygons with visibility properties. Theor. Comput. Sci. 289, 919–937 (2002)
Kannan, R.: Markov chains and polynomial time algorithms. In: 35th IEEE Sympos. Foundations Comput. Sci (FOCS), pp. 656–671 (1994)
Lovász, L.: Random walks on graphs: A survey. In: Combinatorics, Paul Erdös is Eighty. Bolyai Society Math. Studies, vol. 2, pp. 353–398 (1993)
Molloy, M., Reed, B., Steiger, W.: On the mixing rate of the triangulation walk. In: DIMACS Series in Disc. Math. and Theoret. Comput. Sci., vol. 43, pp. 179–190 (1999)
Randall, D.: Rapidly mixing Markov chains with applications in computer science and physics. Comput. Sci. Eng. 8(2), 30–41 (2006)
Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, Basel (1993)
van Leeuwen, J., Schoone, A.A.: Untangling a travelling salesman tour in the plane. In: Mühlbacher, J.R. (ed.) Proc. 7th Internat. Workshop Graph-Theoret. Concepts Comput. Sci., pp. 87–98. Hanser, München (1982)
Zhu, C., Sundaram, G., Snoeyink, J., Mitchell, J.S.B.: Generating random polygons with given vertices. Comput. Geom. Theory Appl. 6, 277–290 (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Damian, M., Flatland, R., O’Rourke, J. et al. Connecting Polygonizations via Stretches and Twangs. Theory Comput Syst 47, 674–695 (2010). https://doi.org/10.1007/s00224-009-9192-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-009-9192-8