Related papers: Realizing Metric Spaces with Convex Obstacles
This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…
We study metric spaces that admit a conical bicombing and thus obey a weak form of non-positive curvature. Prime examples of such spaces are injective metric spaces. In this article we give a complete characterization of complete metric…
In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P) := (f_1+f_2-20)/(f_0+f_3-10) is large if there are many…
Developing classification algorithms that are fair with respect to sensitive attributes of the data has become an important problem due to the growing deployment of classification algorithms in various social contexts. Several recent works…
Decomposition spaces are a class of function spaces constructed out of well-behaved coverings and partitions of unity of a set. The structure of the covering of the set determines the properties of the decomposition space. Besov spaces,…
We prove that a 3-dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by the metric induced on its boundary. Furthemore, any hyperbolic metric on the torus with cone singularities of positive curvature can be…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…
A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…
In this paper, we embed metric space endowed with a convex combination operation, named convex combination space, into a Banach space and the embedding preserves the structures of metric and convex combination. For random element taking…
Full 3D estimation of human pose from a single image remains a challenging task despite many recent advances. In this paper, we explore the hypothesis that strong prior information about scene geometry can be used to improve pose estimation…
Tessellations of $R^3$ that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not facet-to-facet, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's…
In this article, we study the geodesic problem in a generalized metric space, in which the distance function satisfies a relaxed triangle inequality $d(x,y)\leq \sigma (d(x,z)+d(z,y))$ for some constant $\sigma \geq 1$, rather than the…
Three themes of general topology: quotient spaces; absolute retracts; and inverse limits - are reapproached here in the setting of metrizable uniform spaces, with an eye to applications in geometric and algebraic topology. The results…
We develop a new concept of non-positive curvature for metric spaces, based on intersection patterns of closed balls. In contrast to the synthetic approaches of Alexandrov and Buesemann, our concept also applies to metric spaces that might…
Metric search is concerned with the efficient evaluation of queries in metric spaces. In general,a large space of objects is arranged in such a way that, when a further object is presented as a query, those objects most similar to the query…
We investigate metric projections and distance functions referring to convex bodies in finite-dimensional normed spaces. For this purpose we identify the vector space with its dual space by using, instead of the usual identification via the…
Finding correspondences between 3D shapes is an important and long-standing problem in computer vision, graphics and beyond. A prominent challenge are partial-to-partial shape matching settings, which occur when the shapes to match are only…
Let $(M, \partial M)$ be a compact 3-manifold with boundary, which admits a convex co-compact hyperbolic metric. We consider the hyperbolic metrics on $M$ such that the boundary is smooth and strictly convex. We show that the induced…