2000 character limit reached
On the area of constrained polygonal linkages (1702.07468v1)
Published 24 Feb 2017 in math.MG and math.GT
Abstract: We study configuration spaces of linkages whose underlying graph are polygons with diagonal constrains, or more general, partial two-trees. We show that (with an appropriate definition) the oriented area is a Bott-Morse function on the configuration space. Its critical points are described and Bott-Morse indices are computed. This paper is a generalization of analogous results for polygonal linkages (obtained earlier by G. Khimshiashvili, G. Panina, and A. Zhukova).
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.