Related papers: A Metric Framework for Triangle Inequalities via B…
In this paper, we provide suitable characterisations of pairs of weights $(V,W),$ known as Bessel pairs, that ensure the validity of weighted Hardy-type inequalities. The abstract approach adopted here makes it possible to establish such…
In this paper we propose a contour mean calculation and interpolation method designed for averaging manual delineations of objects performed by experts and interpolate 3D layer stack images. The proposed method retains all visible…
Any three-dimensional Riemannian metric can be locally obtained by deforming a constant curvature metric along one direction. The general interest of this result, both in geometry and physics, and related open problems are stressed.
This article presents a novel mathematical formalism for advanced manifold--metric pairs, enhancing the frameworks of geometry and topology. We construct various D-dimensional manifolds and their associated metric spaces using functional…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
In recent works, a framework has been developed to describe (quantum) deformed, spherically symmetric and static black holes in four dimensions. The key idea of this so-called Effective Metric Description (EMD) is to parametrise…
A generalization of the triangle inequality is introduced by a mapping similar to a t-conorm mapping. This generalization leads us to a notion for which we use the $\star$-metric terminology. We are interested in the topological space…
We investigate necessary and sufficient conditions on the weights for the Hardy-Rellich inequalities to hold, and propose a new way to use the notion of Bessel pair to establish the optimal Hardy-Rellich type inequalities. Our results…
We develop a rigidity theory for bar-joint frameworks in Euclidean $d$-space in which specified classes of edges are allowed to change length in a coordinated fashion that requires differences of lengths to be preserved within each class.…
Straight lines are common features in human made environments, which makes them a frequently explored feature for control applications. Many control schemes, like Visual Servoing, require the 3D parameters of the features to be estimated.…
Variational inequalities are a universal optimization paradigm that incorporate classical minimization and saddle point problems. Nowadays more and more tasks require to consider stochastic formulations of optimization problems. In this…
Quantifying the dissimilarity between two unstructured 3D point clouds is a challenging task, with existing metrics often relying on measuring the distance between corresponding points that can be either inefficient or ineffective. In this…
The present survey is devoted to results on Trudinger-Moser inequalities in two dimension. We give a brief overview of the history of these celebrated inequalities and, starting from the geometric problem that motivated Moser's original…
A Bonnesen-type inequality is a sharp isoperimetric inequality that includes an error estimate in terms of inscribed and circumscribed regions. A kinematic technique is used to prove a Bonnesen-type inequality for the Euclidean sphere…
Many metric learning tasks, such as triplet learning, nearest neighbor retrieval, and visualization, are treated primarily as embedding tasks where the ultimate metric is some variant of the Euclidean distance (e.g., cosine or Mahalanobis),…
In this paper, we consider the problem of computing the algebraic parametric equation of the Euclidean 1-center function in $\mathbb{R}^d$, $d \geq 2$, for a system of $n$ static points and $m$ mobile points having motion defined by…
This paper describes a method for fast simplification of surface meshes. Whereas past methods focus on visual appearance, our goal is to solve equations on the surface. Hence, rather than approximate the extrinsic geometry, we construct a…
Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous…
In [Heimann, Lehrenfeld, Preu{\ss}, SIAM J. Sci. Comp. 45(2), 2023, B139 - B165] new geometrically unfitted space-time Finite Element methods for partial differential equations posed on moving domains of higher-order accuracy in space and…
Bregman divergences generalize measures such as the squared Euclidean distance and the KL divergence, and arise throughout many areas of machine learning. In this paper, we focus on the problem of approximating an arbitrary Bregman…