Related papers: Polygon Vertex Extremality and Decomposition of Po…

In this paper we study the area function of polygons, where the vertices are sliding along curves. We give geometric criteria for the critical points and determine also the Hesse matrix at those points. This is the starting point for a…

For two non-congruent regular polygons of the same type, the method of finding the points in the plane at the equal distances to the vertices, is established. The existence of two points with this property is proved for two polygons with a…

In this paper, we study several topics on pedal polygons. First, we prove the existence for pedal centers of triangles in a new way. From its proof, we find that the sum of area of outer and inner polygons is invariant under rotation.…

We determine all critical configurations for the Area function on polygons with vertices on a circle or an ellipse. For isolated critical points we compute their Morse index, resp index of the gradient vector field. We relate the…

A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood and the in-neighbourhood of any vertex induce a semicomplete digraph. In this paper we study various…

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…

In this text we give a decomposition result on polynomial poly-vector fields generalizing a result on the decomposition of homogeneous Poisson structures. We discuss consequences of this decomposition result in particular for low dimensions…

Let $S$ be a set of $2n$ points on a circle such that for each point $p \in S$ also its antipodal (mirrored with respect to the circle center) point $p'$ belongs to $S$. A polygon $P$ of size $n$ is called \emph{antipodal} if it consists of…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

Perception research provides strong evidence in favor of part based representation of shapes in human visual system. Despite considerable differences among different theories in terms of how part boundaries are found, there is substantial…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

We prove that the number of dissections of a given polygon into triangles with fixed areas of faces is finite and that an equidissection is algebraic as long as the vertices of the original polygon have algebraic coordinates.

Our goal here is to see the space of matrices of a given size from a geometric and topological perspective, with emphasis on the families of various ranks and how they fit together. We pay special attention to the nearest orthogonal…

We will first solve the following problem analytically: given a piece of wire of specified length, we will find where the wire should be cut and bent to form two regular polygons not necessarily having the same number of sides, so that the…

We propose an original method for vectorizing an image or zooming it at an arbitrary scale. The core of our method relies on the resolution of a geometric variational model and therefore offers theoretic guarantees. More precisely, it…

We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of $1+1/1080-\varepsilon$.

We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…

It is shown that the local coupling of a higher dimensional graviton to a closed degenerate two-form produces dimensional reduction by spontaneous breakdown of extra-dimensional translational symmetry. Four dimensional Poincar\'e invariance…

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…