Related papers: Approximately angle preserving mappings
Recent years have witnessed a tremendous growth using topological summaries, especially the persistence diagrams (encoding the so-called persistent homology) for analyzing complex shapes. Intuitively, persistent homology maps a potentially…
In this paper, we introduce a variant of spectral sparsification, called probabilistic $(\varepsilon,\delta)$-spectral sparsification. Roughly speaking, it preserves the cut value of any cut $(S,S^{c})$ with an $1\pm\varepsilon$…
We introduce a linear dimensionality reduction technique preserving topological features via persistent homology. The method is designed to find linear projection $L$ which preserves the persistent diagram of a point cloud $\mathbb{X}$ via…
A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of C given orientations; this is a generalization of the notable rectilinear case (C = 2). We study exact and approximation algorithms for…
In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as…
In this article, we introduce a new type of mapping contracting perimeters of triangles in a complete metric space and present related fixed point theorem. We study the metric completeness property of the underlying space in terms of fixed…
We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process. The approaches are (i) shortest path from origin through some…
Calculating the diameter of an undirected graph requires quadratic running time under the Strong Exponential Time Hypothesis and this barrier works even against any approximation better than 3/2. For planar graphs with positive edge…
Swept volume computation, the determination of regions occupied by moving objects, is essential in graphics, robotics, and manufacturing. Existing approaches either explicitly track surfaces, suffering from robustness issues under complex…
In this paper, we present several necessary and sufficient conditions for a harmonic mapping to be normal. Also, we discuss maximum principle and five-point theorem for normal harmonic mappings. Furthermore, we investigate the convergence…
In this paper we present a first-order method that admits near-optimal convergence rates for convex/concave min-max problems while requiring a simple and intuitive analysis. Similarly to the seminal work of Nemirovski and the recent…
We derive new approximations for quintessence solutions that are simpler and an order of magnitude more accurate than anything available in the literature, which from an observational perspective \emph{makes numerical calculations…
We study the structure of representations, defined as approximations of minimal sufficient statistics that are maximal invariants to nuisance factors, for visual data subject to scaling and occlusion of line-of-sight. We derive analytical…
In this paper,we obtain two results on closed Reimainnian manifold $M\times [0,T]$.When $T$ is small enough,to any prescribed scalar curvature, the existence and uniqueness of metrics are obtained on the volume element preserving…
We propose a novel approach for preserving topological structures of the input space in latent representations of autoencoders. Using persistent homology, a technique from topological data analysis, we calculate topological signatures of…
We introduce the notions of pointwise almost h-slant submanifolds and pointwise almost h-semi-slant submanifolds as a generalization of slant submanifolds, pointwise slant submanifolds, semi-slant submanifolds, and pointwise semi-slant…
This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…
Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory.…
The main results of this paper provide VMO-type estimates for the quadratic tilt-excess on varifolds with critical generalized mean curvature. These estimates apply to varifolds with "almost-integral" density which are close to a…
We determine the structure of linear maps on complex (real) square matrices sending unitary (orthogonal) matrices to multiples of unitary (orthogonal) matrices. The result is used to determine the linear preservers of matrix pairs…