Related papers: Families of m-convex polygons: m = 2

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

In this paper, we define a new identity for twice differentiable mappings and obtained some new estimates on the generalization of Hadamard's and Simson's type inequalities for quasi-geometrically convex mappings using of this identity.

We study convexity of image of a general multidimensional quadratic map. We split the full image into two parts by an appropriate hyperplane such that one part is compact, and formulate a sufficient condition for convexity of the compact…

We introduce simple quadrature rules for the family of nonparametric nonconforming quadrilateral element with four degrees of freedom. Our quadrature rules are motivated by the work of Meng {\it et al.} \cite{meng2018new}. First, we…

In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

We consider quasifuchsian manifolds with "particles", i.e., cone singularities of fixed angle less than $\pi$ going from one connected component of the boundary at infinity to the other. Each connected component of the boundary at infinity…

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

The variation distance closure of an exponential family with a convex set of canonical parameters is described, assuming no regularity conditions. The tools are the concepts of convex core of a measure and extension of an exponential…

Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…

In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] +…

A quadrangle in the Euclidean plane is called $n$-self-affine if it has a dissection into $n$ affine images of itself. All convex quadrangles are known to be $n$-self-affine for every $n \ge 5$. The only $2$-self-affine convex quadrangles…

Every three-connected planar graph with n vertices has a drawing on an O(n^2) x O(n^2) grid in which all faces are strictly convex polygons. These drawings are obtained by perturbing (not strictly) convex drawings on O(n) x O(n) grids. More…

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…

We develop two-scale methods for computing the convex envelope of a continuous function over a convex domain in any dimension.This hinges on a fully nonlinear obstacle formulation [A. M. Oberman, "The convex envelope is the solution of a…

We give the quasi--Euclidean classification of the maximal (with respect to the $f$--vector) alcoved polyhedra. The $f$--vector of these maximal convex bodies is $(20,30,12)$, so they are simple dodecahedra. We find eight quasi--Euclidean…

The main objective of this paper is to investigate the $m$-quasi Einstein manifold when the potential function becomes convex. In this article, it is proved that an $m$-quasi Einstein manifold satisfying some integral conditions with…