Consider a mechanical linkages whose underlying graph is a polygon with a diagonal constraint, or more general, a partial two-tree. We show that (with an appropriate definition) the oriented area is a Bott–Morse function on the configuration space of the linkage. 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)
Abstract. We wish to decide whether a simply connected flexible polygonal structure can be realized ...
[[abstract]]A polygonal chain is a sequence of consecutively joined edges embedded in space. A k-cha...
Abstract. Using Morse theory, the configuration space of a 4-gonal (respectively 5-gonal) linkage in...
Consider a mechanical linkages whose underlying graph is a polygon with a diagonal constraint, or mo...
It is known that a closed polygon P is a critical point of the oriented area function if and only if...
A polygonal linkage can be imagined as a set of n rigid bars connected by links cyclically. This co...
A metamorphic linkage has the property that the effective number of links and joints can change duri...
It is known that a closed polygon P is a critical point of the oriented area function if and only if...
This thesis aims to introduce the notions of linkage and its confguration space, that can be motivat...
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basi...
We investigate the critical points of Coulomb potential of point charges placed at the vertices of a...
AbstractOne can form a polygonal linkage by identifying initial and terminal points of two free link...
Abstract. Moduli spaces of planar polygonal linkages admit a cell struc-ture which can be realized a...
We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the pl...
We consider the configuration space of planar n-gons with fixed perimeter, which is diffeomorphic to...
Abstract. We wish to decide whether a simply connected flexible polygonal structure can be realized ...
[[abstract]]A polygonal chain is a sequence of consecutively joined edges embedded in space. A k-cha...
Abstract. Using Morse theory, the configuration space of a 4-gonal (respectively 5-gonal) linkage in...
Consider a mechanical linkages whose underlying graph is a polygon with a diagonal constraint, or mo...
It is known that a closed polygon P is a critical point of the oriented area function if and only if...
A polygonal linkage can be imagined as a set of n rigid bars connected by links cyclically. This co...
A metamorphic linkage has the property that the effective number of links and joints can change duri...
It is known that a closed polygon P is a critical point of the oriented area function if and only if...
This thesis aims to introduce the notions of linkage and its confguration space, that can be motivat...
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basi...
We investigate the critical points of Coulomb potential of point charges placed at the vertices of a...
AbstractOne can form a polygonal linkage by identifying initial and terminal points of two free link...
Abstract. Moduli spaces of planar polygonal linkages admit a cell struc-ture which can be realized a...
We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the pl...
We consider the configuration space of planar n-gons with fixed perimeter, which is diffeomorphic to...
Abstract. We wish to decide whether a simply connected flexible polygonal structure can be realized ...
[[abstract]]A polygonal chain is a sequence of consecutively joined edges embedded in space. A k-cha...
Abstract. Using Morse theory, the configuration space of a 4-gonal (respectively 5-gonal) linkage in...