English
Related papers

Related papers: Intrinsic Local Distances: A Mixed Solution to Wey…

200 papers

Given strong local Dirichlet forms and $\mathbb{R}^N$-valued functions on a metrizable space, we introduce the concepts of geodesic distance and intrinsic distance on the basis of these objects. They are defined in a geometric and an…

Probability · Mathematics 2014-06-26 Masanori Hino

We study the computational complexity of exact cardinality-constrained minimum Riesz $s$-energy subset selection in finite metric spaces: given $n$ points, select $k<n$ points of minimum Riesz $s$-energy. The objective sums inverse-power…

Computational Geometry · Computer Science 2026-05-07 Michael T. M. Emmerich , Ksenia Pereverdieva , André Deutz

We develop a new method to estimate the area, and more generally the intrinsic volumes, of a compact subset $X$ of $\mathbb{R}^d$ from a set $Y$ that is close in the Hausdorff distance. This estimator enjoys a linear rate of convergence as…

Metric Geometry · Mathematics 2024-07-22 David Cohen-Steiner , Antoine Commaret

We provide a gauge-invariant theory of gravitation in the context of Weyl Integrable Space-Times. After making a brief review of the theory's postulates, we carefully define the observers' proper-time and point out its relation with…

General Relativity and Quantum Cosmology · Physics 2014-10-31 F. P. Poulis , J. M. Salim

Extremal length is a conformal invariant that transfers naturally to the discrete setting, giving square tilings as a natural combinatorial analog of conformal mappings. Recent work by S. Hersonsky has explored generalizing these ideas to…

Differential Geometry · Mathematics 2014-09-30 William E. Wood

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…

Computational Geometry · Computer Science 2024-06-03 Ahmad Biniaz , Anil Maheshwari , Michiel Smid

In this article, I develop an elementary system of axioms for Euclidean geometry. On one hand, the system is based on the symmetry principles which express our a priori ignorant approach to space: all places are the same to us (the…

History and Overview · Mathematics 2021-06-01 Boris Čulina

Since the introduction of the Sliced Wasserstein distance in the literature, its simplicity and efficiency have made it one of the most interesting surrogate for the Wasserstein distance in image processing and machine learning. However,…

Optimization and Control · Mathematics 2025-08-05 Eloi Tanguy , Laetitia Chapel , Julie Delon

We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…

Algebraic Geometry · Mathematics 2008-06-27 Adel Khalfallah , Siegmund Kosarew

Traditional manifold learning algorithms assumed that the embedded manifold is globally or locally isometric to Euclidean space. Under this assumption, they divided manifold into a set of overlapping local patches which are locally…

Machine Learning · Computer Science 2017-06-23 Yangyang Li

Evolutionary relationships between species are represented by phylogenetic trees, but these relationships are subject to uncertainty due to the random nature of evolution. A geometry for the space of phylogenetic trees is necessary in order…

Statistics Theory · Mathematics 2022-09-21 Jonas Lueg , Maryam K. Garba , Tom M. W. Nye , Stephan F. Huckemann

We describe new approaches for distances between pairs of 2-dimensional surfaces (embedded in 3-dimensional space) that use local structures and global information contained in inter-structure geometric relationships. We present algorithms…

Numerical Analysis · Mathematics 2015-05-30 D. Boyer , Y. Lipman , E. St. Clair , J. Puente , T. Funkhouser , B. Patel , J. Jernvall , I. Daubechies

This introductory survey deals with mathematical and physical properties of discrete structures such as point sets and tilings. The emphasis is on proper generalizations of concepts and ideas from classical crystallography. In particular,…

Mathematical Physics · Physics 2007-05-23 Michael Baake

In the directed setting, the spaces of directed paths between fixed initial and terminal points are the defining feature for distinguishing different directed spaces. The simplest case is when the space of directed paths is homotopy…

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…

Optimization and Control · Mathematics 2021-10-25 Paolo Albano , Vincenzo Basco , Piermarco Cannarsa

We initiate a study of the Euclidean Distance Degree in the context of sparse polynomials. Specifically, we consider a hypersurface f=0 defined by a polynomial f that is general given its support, such that the support contains the origin.…

Algebraic Geometry · Mathematics 2021-06-01 Paul Breiding , Frank Sottile , James Woodcock

Consider a set of points sampled independently near a smooth compact submanifold of Euclidean space. We provide mathematically rigorous bounds on the number of sample points required to estimate both the dimension and the tangent spaces of…

Statistics Theory · Mathematics 2023-09-26 Uzu Lim , Harald Oberhauser , Vidit Nanda

We solve a regularized weighted low-rank approximation problem by a stochastic gradient descent on a manifold. To guarantee the convergence of our stochastic gradient descent, we establish a convergence theorem on manifolds for…

Optimization and Control · Mathematics 2025-02-21 Conglong Xu , Peiqi Yang , Hao Wu

Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recently, significant improvements were made in higher dimensions, leading to new methods to reconstruct large classes…

Computational Geometry · Computer Science 2007-12-18 Frédéric Chazal , Steve Oudot