Related papers: Realizing Metric Spaces with Convex Obstacles
We obtain higher dimensional analogues of the results of Mantoulidis and Schoen in [8]. More precisely, we show that (i) any metric $g$ with positive scalar curvature on the $3$-sphere $S^3$ can be realized as the induced metric on the…
We consider the problem of convex function chasing with black-box advice, where an online decision-maker aims to minimize the total cost of making and switching between decisions in a normed vector space, aided by black-box advice such as…
Geodesic convexity (g-convexity) is a natural generalization of convexity to Riemannian manifolds. However, g-convexity lacks many desirable properties satisfied by Euclidean convexity. For instance, the natural notions of half-spaces and…
We study several constrained variational problem in the 2-Wasserstein metric for which the set of probability densities satisfying the constraint is not closed. For example, given a probability density $F_0$ on $\R^d$ and a time-step $h>0$,…
The robust topology optimization formulation that introduces the eroded and dilated versions of the design has gained increasing popularity in recent years, mainly because of its ability to produce designs satisfying a minimum length scale.…
In this article, we introduce a notion of curvature, denoted by $ k_X(T)$, for a metric triple $T$ inside a (possibly discrete) metric space $X$. Such a notion enables us to consider curvature information of any metric space, including…
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…
An analysis of high-dimensional data can offer a detailed description of a system but is often challenged by the curse of dimensionality. General dimensionality reduction techniques can alleviate such difficulty by extracting a few…
Identifying the obstacle space is crucial for path planning. However, generating an accurate obstacle space remains a significant challenge due to various sources of uncertainty, including motion, behavior, and perception limitations. Even…
This paper presents a density-based topology optimization method for designing 3D thin-walled structures with adaptive meshing. Uniform wall thickness is achieved by simultaneously constraining the minimum and maximum feature sizes using…
We give the first non-trivial decremental dynamic embedding of a weighted, undirected graph $G$ into $\ell_p$ space. Given a weighted graph $G$ undergoing a sequence of edge weight increases, the goal of this problem is to maintain a…
Given two points in the plane, a set of obstacles defined by closed curves, and an integer $k$, does there exist a path between the two designated points intersecting at most $k$ of the obstacles? This is a fundamental and well-studied…
We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…
In this paper we show how some metric properties of the unit sphere of a normed space can help to approach a solution to Tingley's problem. In our main result we show that if an onto isometry between the spheres of strictly convex spaces is…
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…
A generalization of metric space is presented which is shown to admit a theory strongly related to that of ordinary metric spaces. To avoid the topological effects related to dropping any of the axioms of metric space, first a new, and…
The Distance Geometry Problem asks for a realization of a given weighted graph in $\mathbb{R}^K$. Two variants of this problem, both originating from protein conformation, are based on a given vertex order (which abstracts the protein…
Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having…
We introduce the geodesic complexity of a metric space, inspired by the topological complexity of a topological space. Both of them are numerical invariants, but, while the TC only depends on the homotopy type, the GC is an invariant under…
Sparse additive modeling is a class of effective methods for performing high-dimensional nonparametric regression. In this work we show how shape constraints such as convexity/concavity and their extensions, can be integrated into additive…