Computer Science – Computational Geometry
Scientific paper
2007-09-12
Computer Science
Computational Geometry
15 pages, 14 figures, 3 appendices
Scientific paper
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''.
These atomic moves walk between weakly simple ``polygonal wraps'' of S. These
moves show promise to serve as a basis for generating random polygons.
Damian Mirela
Flatland Robin
O'Rourke Joseph
Ramaswami Suneeta
No associations
LandOfFree
Connecting Polygonizations via Stretches and Twangs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Connecting Polygonizations via Stretches and Twangs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connecting Polygonizations via Stretches and Twangs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-23084