2000 character limit reached
Connecting Polygonizations via Stretches and Twangs
Published 12 Sep 2007 in cs.CG and cs.DM | (0709.1942v1)
Abstract: 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 calledstretches'' and twangs''. These atomic moves walk between weakly simplepolygonal wraps'' of S. These moves show promise to serve as a basis for generating random polygons.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.