Related papers: Software for the Thompson and Funk Polygonal Geome…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
We consider the following problem in computational geometry: given, in the d-dimensional real space, a set of points marked as positive and a set of points marked as negative, such that the convex hull of the positive set does not intersect…
Stability of nonconvex quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces is investigated. We present several stability properties of the global solution map, and the continuity of the optimal…
We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…
A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of…
This paper is an introduction to the hyperbolic geometry of noncommutative polyballs B_n of bounded linear operators on Hilbert spaces. We use the theory of free pluriharmonic functions on polyballs and noncommutative Poisson kernels on…
In this paper we discuss various connections between geometric discrepancy measures, such as discrepancy with respect to convex sets (and convex sets with smooth boundary in particular), and applications to numerical analysis and…
Inversions of airborne EM data are often an iterative process, not only requiring that the researcher be able to explore the impact of changing components such as the choice of regularization functional or model parameterization, but also…
This is an experimental case study in real algebraic geometry, aimed at computing the image of a semialgebraic subset of 3-space under a polynomial map into the plane. For general instances, the boundary of the image is given by two highly…
We describe a simple geometric transformation of triangles which leads to an efficient and effective algorithm to smooth triangle and tetrahedral meshes. Our focus lies on the convergence properties of this algorithm: we prove the…
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…
Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…
In 1929, Paul Funk and Ludwig Berwald gave a characterization of Hilbert geometries from the Finslerian viewpoint. They showed that a smooth Finsler metric in a convex bounded domain of $\mathbb{R}^n$ is the Hilbert geometry in that domain…
In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…
Inclusion properties are studied for balls of the triangular ratio metric, the hyperbolic metric, the $j^*$-metric, and the distance ratio metric defined in the unit ball domain. Several sharp results are proven and a conjecture about the…
Compensated convex transforms have been introduced for extended real-valued functions defined over $\mathbb{R}^n$. In their application to image processing, interpolation, and shape interrogation, where one deals with functions defined over…
Soft elastic filaments that can be stretched, bent and twisted exhibit a range of topologically and geometrically complex morphologies that include plectonemes, solenoids, knot-like and braid-like structures. We combine numerical…
In this paper, we consider the quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces. By using the Legendre property of quadratic forms or the compactness of operators in the presentations of…
Symmetric cones can be endowed with at least two interesting non Riemannian metrics: the Hilbert and the Thompson metrics. It is trivial that the linear maps preserving the cone are isometries for those two metrics. Oddly enough those are…
Volumetric parameterization problem refers to parameterization of both the interior and boundary of a 3D model. It is a much harder problem compared to surface parameterization where a parametric representation is worked out only for the…