Straightening Polygonal Arcs and Convexifying Polygonal Cycles
نویسندگان
چکیده
Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc or cycle. We prove that the linkage can be continuously moved so that the arcs become straight, the cycles become convex, and no bars cross while preserving the bar lengths. Furthermore, our motion is piecewise-differentiable, does not decrease the distance between any pair of vertices, and preserves any symmetry present in the initial configuration. In particular, this result settles the well-studied carpenter’s rule conjecture.
منابع مشابه
Straighting Polygonal Arcs and Convexifying Polygonal Cycles
Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc or cycle. We prove that the linkage can be continuously moved so that the arcs become straight, the cycles become convex, and no bars cross while preserving the bar lengths. Furthermore, our motion is pie...
متن کاملApproximation of an open polygonal curve with a minimum number of circular arcs and biarcs
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting tools are usually described with circular arcs and straight line segments. Greedy algorithms for approximating a polygonal curve with curves of higher order can be found in the literature. Without theoretical bounds it ...
متن کاملOn Unfolding Lattice Polygons/Trees and Diameter-4 Trees
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossings are allowed. A tree can be straightened if all its edges can be aligned along a common straight line such that each edge points “away” from a designated leaf node. A polygon can be convexified if it can be reconfigu...
متن کاملPolygonal tiling of some surfaces containing fullerene molecules
A tiling of a surface is a decomposition of the surface into pieces, i.e. tiles, which cover it without gaps or overlaps. In this paper some special polygonal tiling of sphere, ellipsoid, cylinder, and torus as the most abundant shapes of fullerenes are investigated.
متن کاملClamped-Free Non Homogeneous Magneto Electro Elastic Plate of Polygonal Cross-Sections with Hydrostatic Stress and Gravity
In this article, the influence of hydrostatic stress and gravity on a clamped- free non homogeneous magneto electro elastic plate of polygonal cross sections is studied using linear theory of elasticity. The equations of motion based on two-dimensional theory of elasticity are applied under the plane strain assumption of prestressed and gravitated magneto electro elastic plate of polygonal cros...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000