相关论文: Computing the $L_1$ Geodesic Diameter and Center o…

We study elliptic-like geodesic motion on hyperplanes orthogonal to the cylindrical symmetry axes of the Godel spacetime by using an eccentricity-semi-latus rectum parametrization which is familiar from the Newtonian description of a…

The width $k$ of a directed acyclic graph (DAG) $G = (V, E)$ equals the largest number of pairwise non-reachable vertices. Computing the width dates back to Dilworth's and Fulkerson's results in the 1950s, and is doable in quadratic time in…

We consider a region $M$ in $\mathbb{R}^n$ with boundary $\partial M$ and a metric $g$ on $M$ conformal to the Euclidean metric. We analyze the inverse problem, originally formulated by Dix, of reconstructing $g$ from boundary measurements…

This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…

We present an algorithm that computes the girth of the intersection graph of $n$ given line segments in the plane in $O(n^{1.483})$ expected time. This is the first such algorithm with $O(n^{3/2-\varepsilon})$ running time for a positive…

Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational geometry and has been studied extensively. Previously,…

We consider a classical k-center problem in trees. Let T be a tree of n vertices and every vertex has a nonnegative weight. The problem is to find k centers on the edges of T such that the maximum weighted distance from all vertices to…

We describe ways to define and calculate $L_1$-norm signal subspaces which are less sensitive to outlying data than $L_2$-calculated subspaces. We start with the computation of the $L_1$ maximum-projection principal component of a data…

Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently…

We investigate the special K\"ahler geometry of the base of the Hitchin integrable system in terms of spectral curves and topological recursion. The Taylor expansion of the special K\"ahler metric about any point in the base may be computed…

We study approximation algorithms for the following geometric version of the maximum coverage problem: Let $\mathcal{P}$ be a set of $n$ weighted points in the plane. Let $D$ represent a planar object, such as a rectangle, or a disk. We…

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…

We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…

In this paper, we propose a fast and convergent algorithm to solve unassigned distance geometry problems (uDGP). Technically, we construct a novel quadratic measurement model by leveraging $\ell_0$-norm instead of $\ell_1$-norm in the…

We prove a quantitative estimate, with a power saving error term, for the number of simple closed geodesics of length at most $L$ on a compact surface equipped with a Riemannian metric of negative curvature. The proof relies on the…

In this paper we use the genuinely multidimensional HLL Riemann solvers recently developed by Balsara et al. to construct a new class of computationally efficient high order Lagrangian ADER-WENO one-step ALE finite volume schemes on…

Let $N$ be a closed submanifold of a complete manifold, $M$. Then under certain topological conditions, there exists an orthogonal geodesic chord beginning and ending in $N$. In this paper we establish an upper bound for the length of such…

The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…

Motivated by the $k$-center problem in location analysis, we consider the \emph{polygon burning} (PB) problem: Given a polygonal domain $P$ with $h$ holes and $n$ vertices, find a set $S$ of $k$ vertices of $P$ that minimizes the maximum…

Efficiently computing accurate representations of high-dimensional data is essential for data analysis and unsupervised learning. Dendrograms, also known as ultrametrics, are widely used representations that preserve hierarchical…