We study Sobolev-type metrics of fractional order on the group of compactly supported diffeomorphisms Diffc(M), where M is a Riemannian manifold of bounded geometry. We prove that the geodesic distance, induced by the Riemannian metric, vanishes if the order s satisfies 0 ≤ s < 1 2 . For M 6= R we show the vanishing of the geodesic distance also for s = 1 2 , and for dim(M) = 1 we show that the...

We investigate the higher-order Voronoi diagrams of n point sites with respect to the geodesic distance in a simple polygon with h > 0 polygonal holes and c corners. Given a set of n point sites, the korder Voronoi diagram partitions the plane into several regions such that all points in a region share the same k nearest sites. The nearest-site (first-order) geodesic Voronoi diagram has already...

We find a different approach to define convex functions in the subRiemannian setting. A function on a sub-Riemannian manifold is nonholonomically geodesic convex if its restriction to any nonholonomic (straightest) geodesic is convex. In the case of Carnot groups, this definition coincides with that by Danniell-Garofalo-Nieuhn (equivalent to that by Lu-Manfredi-Stroffolini). Nonholonomic geodes...

In this paper, we present a new approach that allows the detection of brain tumors. The approach is based on mathematical methods such as correlation, covariance and geodesic distance. Before proceeding to the segmentation and automatic extraction, the detection of central indices of abnormal tissues is based on the method of correlation and covariance. From these indices, segmentation of brain...

This article presents a solution along with experimental results for an application of semi-supervised machine learning techniques and improvement on the SVM (Support Vector Machine) based on geodesic model to build text classification applications for Vietnamese language. The objective here is to improve the semi-supervised machine learning by replacing the kernel function of SVM using geodesi...

We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish non branching geodesic space. We show that we can reduce the transport problem to 1-dimensional transport problems along geodesics. We introduce an assumption on the transport problem π which implies that the conditional probabilities of the first marginal on each geodesic are continuous. It is known that...

The geodesic k-center problem in a simple polygon with n vertices consists in the following. Find a set S of k points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in S. In this paper, we focus on the case where k = 2 and present an exact algorithm that returns a geodesic 2-center in O(n log n) time.