Related papers: A Geometric Solution to the Isoperimetric Problem …
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…
The isoperimetric ratio of an embedded surface in $R^3$ is defined as the ratio of the area of the surface to power three to the squared enclosed volume. The aim of the present work is to study the minimization of the Willmore energy under…
In this article, we discuss the numerical solution of diffusion equations on random surfaces within the isogeometric framework. We describe in detail, how diffusion problems on random surfaces can be modelled and how quantities of interest…
Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{i=1}^n |A_i A_{i+1}|=1$. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of…
In this paper, we deals with isoperimetric-type inequalities for closed convex curves in the Euclidean plane R^2. We derive a family of parametric inequalities involving the following geometric functionals associated to a given convex curve…
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and rectangle K-centers. All the…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
We consider a convex Euclidean hypersurface that evolves by a volume or area preserving flow with speed given by a general nonhomogeneous function of the mean curvature. For a broad class of possible speed functions, we show that any closed…
An efficient technique to solve precision problems consists in using exact computations. For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters. The predicate is first evaluated…
In this paper, an efficient algorithm to find the center of the biggest circle inscribed in a given polygon is described. This work was inspired by the publication of Daniel Garcia-Castellanos & Umberto Lombardo and their algorithm used to…
The isodiametric inequality is derived from the isoperimetric inequality trough a variational principle, establishing that balls maximize the perimeter among convex sets with fixed diameter. This principle brings also quantitative…
In this paper, we present our heuristic solutions to the problems of finding the maximum and minimum area polygons with a given set of vertices. Our solutions are based mostly on two simple algorithmic paradigms: greedy method and local…
We verify an old conjecture of G. Polya and G. Szego saying that the regular n-gon minimizes the logarithmic capacity among all n-gons with a fixed area.
Geometric embeddings have recently received attention for their natural ability to represent transitive asymmetric relations via containment. Box embeddings, where objects are represented by n-dimensional hyperrectangles, are a particularly…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the curvature error. Parametric polynomial curves of low degree are used and a geometric continuity is…
We establish a new symmetrization procedure for the isoperimetric problem in symmetric spaces of noncompact type. This symmetrization generalizes the well known Steiner symmetrization in euclidean space. In contrast to the classical…
Although the isogeometric analysis has shown its great potential in achieving highly accurate numerical solutions of partial differential equations, its efficiency is the main factor making the method more competitive in practical…
We introduce tropical analogues of the notion of volume of polytopes, leading to a tropical version of the (discrete) classical isoperimetric inequality. The planar case is elementary, but a higher-dimensional generalization leads to an…
We present a computational framework for efficient optimization-based "inverse design" of large-area "metasurfaces" (subwavelength-patterned surfaces) for applications such as multi-wavelength and multi-angle optimizations, and…
Using isoperimetry and symmetrization we provide a unified framework to study the classical and logarithmic Sobolev inequalities. In particular, we obtain new Gaussian symmetrization inequalities and connect them with logarithmic Sobolev…