Homology of Planar Polygon
نویسندگان
چکیده
In this paper we study topology of the variety of closed pla-nar n-gons with given side lengths l1,. .. , ln. The moduli space M ℓ where ℓ = (l1,. .. , ln), encodes the shapes of all such n-gons. We describe the Betti numbers of the moduli spaces M ℓ as functions of the length vector ℓ = (l1,. .. , ln). We also find sharp upper bounds on the sum of Betti numbers of M ℓ depending only on the number of links n. Our method is based on an observation of a remarkable interaction between Morse functions and involutions under the condition that the fixed points of the involution coincide with the critical points of the Morse function.
منابع مشابه
An application of geometrical isometries in non-planar molecules
In this paper we introduce a novel methodology to transmit the origin to the center of a polygon in a molecule structure such that the special axis be perpendicular to the plane containing the polygon. The mathematical calculation are described completely and the algorithm will be showed as a computer program.
متن کاملHomology of Planar Polygon Spaces
In this paper we study topology of the variety of closed planar n-gons with given side lengths l1, . . . , ln. The moduli space M` where ` = (l1, . . . , ln), encodes the shapes of all such n-gons. We describe the Betti numbers of the moduli spaces M` as functions of the length vector ` = (l1, . . . , ln). We also find sharp upper bounds on the sum of Betti numbers of M` depending only on the n...
متن کاملDecompositions of Objects Bounded by Algebraic Curves
We present a.n algorithm to decompose the edges of planar curved object so that the carrier polygon of decomposed boundary is a simple polygon. We also present an algoritbm to compute a simple characteristic carrier polygon. By refining this decomposition further and using the chords and wedges of decomposed edges, we obtain an inner polygon (resp. an outer polygon) which is a simple polygon to...
متن کاملA fast trapezoidation technique for planar polygons
Triangulation is one of the most popular methods for decomposing a planar polygon into primitive cells. Often trapezoidation is performed as a first step in triangulation. That is, a polygon is decomposed into a set of trapezoids; a trapezoid being a four sided polygon with two parallel sides. Although much work has gone into fast triangulation methods, there has been little work on trapezoidat...
متن کاملSurvey on Convex Drawing of Planar Graph
This paper presented study on convex drawing of planar graph. In graph theory, a planar graph is a graph that can be embedded in the plane. A planar graph is one that can be drawn on a plane in such a way that there are no “edge crossings,” i.e. edges intersect only at their common vertices. Convex polygon has all interior angles less than or equal to 180°. A graph is called a convex drawing if...
متن کامل