English
Related papers

Related papers: A Geometric Solution to the Isoperimetric Problem …

200 papers

The goal of this note is to give the unified approach to the solutions of a class of isoperimetric problems by relating them to the exterior differential systems studied by R.~Bryant and P.~Griffiths. In this note we list several classical…

Analysis of PDEs · Mathematics 2016-12-06 Paata Ivanisvili , Alexander Volberg

In this paper we present efficient algorithmic solutions for several constrained resource allocation, management and discovery problems. We consider new types of resource allocation models and constraints, and we present new geometric…

Data Structures and Algorithms · Computer Science 2009-06-09 Mugurel Ionut Andreica , Madalina Ecaterina Andreica , Daniel Ardelean

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

Computational Geometry · Computer Science 2021-08-03 Shai Gul , Reuven Cohen , Simi Haber

This paper presents the classification of a general quadric into an axisymmetric quadric (AQ) and the solution to the problem of the proximity of a given point to an AQ. The problem of proximity in $R^3$ is reduced to the same in $R^2$,…

Robotics · Computer Science 2025-10-13 Bibekananda Patra , Aditya Mahesh Kolte , Sandipan Bandyopadhyay

A key problem in multiobjective linear programming is to find the set of all efficient extreme points in objective space. In this paper we introduce oriented projective geometry as an efficient and effective framework for solving this…

Optimization and Control · Mathematics 2010-06-17 Benjamin A. Burton , Melih Ozlen

We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…

Computer Vision and Pattern Recognition · Computer Science 2007-05-23 Pierre-François Marteau , Gilbas Ménier

We consider several geometric inequalities in general relativity involving mass, area, charge, and angular momentum for asymptotically hyperboloidal initial data. We show how to reduce each one to the known maximal (or time symmetric) case…

General Relativity and Quantum Cosmology · Physics 2016-01-27 Ye Sle Cha , Marcus Khuri , Anna Sakovich

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

Computational Geometry · Computer Science 2023-03-08 Paolo Amore

This paper starts by introducing results from geometric measure theory to prove symmetric decreasing rearrangement inequalities on $\mathbb{R}^n$, which give multiple proofs of the isoperimetric and P\'{o}lya-Szeg\H{o} inequalities. Then we…

Differential Geometry · Mathematics 2024-11-26 Richard Stone

Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…

Optimization and Control · Mathematics 2026-04-09 Alberto De Marchi

The geometry of a two-dimensional surface in a curved space can be most easily visualized by using an isometric embedding in flat three-dimensional space. Here we present a new method for embedding surfaces with spherical topology in flat…

General Relativity and Quantum Cosmology · Physics 2009-11-07 Mihai Bondarescu , Miguel Alcubierre , Edward Seidel

This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…

Optimization and Control · Mathematics 2022-04-20 Xiaoxi Jia , Christian Kanzow , Patrick Mehlitz , Gerd Wachsmuth

We present an algorithm to compute the geometric median of shapes which is based on the extension of median to high dimensions. The median finding problem is formulated as an optimization over distances and it is solved directly using the…

Computer Vision and Pattern Recognition · Computer Science 2019-04-17 Alexandre Cunha

Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…

Computer Vision and Pattern Recognition · Computer Science 2024-04-04 Maolin Gao , Zorah Lähner , Johan Thunberg , Daniel Cremers , Florian Bernard

We introduce an algorithm which can be directly used to feasible and optimum search in linear programming. Starting from an initial point the algorithm iteratively moves a point in a direction to resolve the violated constraints. At the…

Optimization and Control · Mathematics 2023-12-05 Denys Shcherbak , Natalya Pya Arnqvist

We study the isoperimetric problem for Euclidean space endowed with a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive…

Differential Geometry · Mathematics 2007-05-23 César Rosales , Antonio Cañete , Vincent Bayle , Frank Morgan

We classify the volume preserving stable hypersurfaces in the real projective space $\mathbb{RP}^n$. As a consequence, the solutions of the isoperimetric problem are tubular neighborhoods of projective subspaces $\mathbb{RP}^k\subset…

Differential Geometry · Mathematics 2023-02-28 Celso Viana

In this paper we prove the existence of isoperimetric regions of any volume in Riemannian manifolds with Ricci bounded below assuming Gromov--Hausdorff asymptoticity to the suitable simply connected model of constant sectional curvature.…

Differential Geometry · Mathematics 2022-09-07 Gioacchino Antonelli , Mattia Fogagnolo , Marco Pozzetta

We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Joseph O'Rourke

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

Metric Geometry · Mathematics 2026-04-24 Fernando Mário de Oliveira Filho , Andreas Spomer , Frank Vallentin
‹ Prev 1 3 4 5 6 7 10 Next ›