Related papers: Geodesic Order Types

Let $F$ be a lower semicontinuous, 1-homogeneous positive function defined on $\mathbf{R}^n$. We provide a characterization of absolutely continuous paths that minimize the anisotropic $F$-length between two points. The characterization is…

In the present paper, we show that the minimal length of closed geodesics on finite-type hyperbolic surfaces with self-intersection number $k$ has order $2\log k$ as $k$ gets large.

In this note we reduce the problem of geodesic connectedness in a wide class of G\"odel type spacetimes to the search of critical points of a functional naturally involved in the study of geodesics in standard static spacetimes. Then, by…

Given a finite set of points $C \subseteq \mathbb{R}^d$, we say that an ordering of $C$ is protrusive if every point lies outside the convex hull of the points preceding it. We give an example of a set $C$ of $5$ points in the Euclidean…

Consider finitely many points in a geodesic space. If the distance of two points is less than a fixed threshold, then we regard these two points as "near". Connecting near points with edges, we obtain a simple graph on the points, which is…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

Comparing and computing distances between phylogenetic trees are important biological problems, especially for models where edge lengths play an important role. The geodesic distance measure between two phylogenetic trees with edge lengths…

A \emph{simple} $s,t$ path $P$ in a rectangular grid graph $\mathbb{G}$ is a Hamiltonian path from the top-left corner $s$ to the bottom-right corner $t$ such that each \emph{internal} subpath of $P$ with both endpoints $a$ and $b$ on the…

We propose a notion of distance between two parametrized planar curves, called their discrepancy, and defined intuitively as the minimal amount of deformation needed to deform the source curve into the target curve. A precise definition of…

Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…

The order type of a point set in $R^d$ maps each $(d{+}1)$-tuple of points to its orientation (e.g., clockwise or counterclockwise in $R^2$). Two point sets $X$ and $Y$ have the same order type if there exists a mapping $f$ from $X$ to $Y$…

Geodesic orbit spaces (or g.o. spaces) are defined as those homogeneous Riemannian spaces $(M=G/H,g)$ whose geodesics are orbits of one-parameter subgroups of $G$. The corresponding metric $g$ is called a geodesic orbit metric. We study the…

The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…

Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point,…

Given a graph $G$, a geodesic packing in $G$ is a set of vertex-disjoint maximal geodesics, and the geodesic packing number of $G$, ${\gpack}(G)$, is the maximum cardinality of a geodesic packing in $G$. It is proved that the decision…

Let $P$ be a simple polygon, then the art gallery problem is looking for a minimum set of points (guards) that can see every point in $P$. We say two points $a,b\in P$ can see each other if the line segment $seg(a,b)$ is contained in $P$.…

We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…

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…

Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its…

Let $P$ be a crossing-free polygon and $\mathcal C$ a set of shortcuts, where each shortcut is a directed straight-line segment connecting two vertices of $P$. A shortcut hull of $P$ is another crossing-free polygon that encloses $P$ and…