Related papers: Geodesic Order Types

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $L/k$, where $L$ is the length of the geodesic. We investigate the existence and behavior of these curves on doubled polygons and show…

We propose a geometric structure induced by any given convex polygon $P$, called $Nest(P)$, which is an arrangement of $\Theta(n^2)$ line segments, each of which is parallel to an edge of $P$, where $n$ denotes the number of edges of $P$.…

Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex of the path. It is known that, if S is sufficiently large,…

Let $\Omega$ be a connected open set in the plane and $\gamma: [0,1] \to \overline{\Omega}$ a path such that $\gamma((0,1)) \subset \Omega$. We show that the path $\gamma$ can be ``pulled tight'' to a unique shortest path which is homotopic…

We prove existence and uniqueness results for conical geodesic bicombings on subsets of normed vector spaces. Concerning existence, we give a first example of a non-consistent convex geodesic bicombing. Furthermore, we show that under a…

A geodesic orbit manifold is a complete Riemannian manifold all of whose geodesics are orbits of one-parameter groups of isometries. We give both a geometric and an algebraic characterization of geodesic orbit manifolds that are…

It is known that any periodic map of order $n$ on a closed oriented surface of genus $g$ can be equivariantly embedded into $S^m$ for some $m$. In the orientable and smooth category, we determine the smallest possible $m$ when $n\geq 3g$.…

We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other systems of orientations on triples that satisfy a…

Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…

We determine a particular class of Roter type warped product manifolds. We show that every manifold of that class admits a geodesic mapping onto a some Roter type warped product manifold. Moreover, both geodesically related manifolds are…

We prove a discreteness result for the possible orders of harmonic maps from surfaces to Euclidean buildings; in particular for a building of type $W$ the order is of the form $\frac mk$ where $k$ divides $|W|$. This generalizes, in the…

We develop a new method for visualizing and refining the invariances of learned representations. Specifically, we test for a general form of invariance, linearization, in which the action of a transformation is confined to a low-dimensional…

In this paper we address two different related problems. We first study the problem of finding a simple shortest path in a $d$-dimensional real space subdivided in several polyhedra endowed with different $\ell_p$-norms. This problem is a…

Piecewise Euclidean structures (identified solid Euclidean polyhedra) on topological 3-dimensional manifolds and pseudo-manifolds are constructed so that they admit pseudo-foliations, a generalized type of foliation. The construction of…

The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…

This work discusses an approach to solving geometric construction problems in which the given figure is included in a set ordered by construction steps. The flow of information is carried through the chain, allowing the original problem to…

In designing a network to link n cities in a square of area n, one might be guided by the following two desiderata. First, the total network length should not be much greater than the length of the shortest network connecting all cities.…

We define a total order, which we call rooted order, on minimal generating set of $J(P_n)^s$ where $J(P_n)$ is the cover ideal of a path graph on $n$ vertices. We show that each power of a cover ideal of a path has linear quotients with…