Connecting Polygonizations via Stretches and Twangs

@article{Damian2009ConnectingPV,
  title={Connecting Polygonizations via Stretches and Twangs},
  author={M. Damian and Robin Y. Flatland and J. O'Rourke and S. Ramaswami},
  journal={Theory of Computing Systems},
  year={2009},
  volume={47},
  pages={674-695}
}
  • M. Damian, Robin Y. Flatland, +1 author S. Ramaswami
  • Published 2009
  • Computer Science, Mathematics
  • Theory of Computing Systems
  • We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2) “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. 
    6 Citations

    Figures and Topics from this paper

    Detecting Weakly Simple Polygons
    • 44
    • PDF
    30 POLYGONS
    • PDF
    Flips in planar graphs
    • 97
    On the Enumeration of Permutominoes
    • A. Tomás
    • Mathematics, Computer Science
    • FCT
    • 2015
    • PDF

    References

    SHOWING 1-10 OF 22 REFERENCES
    Generating Random Polygons with Given Vertices
    • 72
    Lower bounds on the number of crossing-free subgraphs of KN
    • 113
    • PDF
    On local transformation of polygons with visibility properties
    • 17
    • Highly Influential
    Flips in planar graphs
    • 97
    On polygons enclosing point sets
    • 5
    • PDF
    On Polygons Enclosing Point Sets II
    • 6
    • PDF
    A Tight Lower Bound on the Cover Time for Random Walks on Graphs
    • U. Feige
    • Mathematics, Computer Science
    • Random Struct. Algorithms
    • 1995
    • 203
    Random Walks on Graphs: a Survey
    • 1,215
    • PDF
    A Tight Upper Bound on the Cover Time for Random Walks on Graphs
    • U. Feige
    • Computer Science
    • Random Struct. Algorithms
    • 1995
    • 148
    Random Walks on Graphs: A Survey
    • 837
    • PDF