Related papers: Geodesics in CAT(0) Cubical Complexes
This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Miller, Owen…
We consider geodesically convex optimization problems involving distances to a finite set of points $A$ in a CAT(0) cubical complex. Examples include the minimum enclosing ball problem, the weighted mean and median problems, and the…
In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean complex is non-positively curved. In particular, given such a complex we show how to define a boolean…
We describe a correspondence between spaces with walls and CAT(0) cube complexes.
Given a finite CAT(0) cubical complex, we define a flag simplicial complex associated to it, called the crossing complex. We show that the crossing complex holds much of the combinatorial information of the original cubical complex: for…
Let $X$ be a compact, geodesically complete, locally CAT(0) space such that the universal cover admits a rank one axis. Assume $X$ is not homothetic to a metric graph with integer edge lengths. Let $P_t$ be the number of parallel classes of…
CAT(0) metric spaces and hyperbolic spaces play an important role in combinatorial and geometric group theory. In this paper, we present efficient algorithms for distance problems in CAT(0) planar complexes. First of all, we present an…
Given a reconfigurable system X, such as a robot moving on a grid or a set of particles traversing a graph without colliding, the possible positions of X naturally form a cubical complex S(X). When S(X) is a CAT(0) space, we can explicitly…
In this project we explore the geometry of general metric spaces, where we do not necessarily have the tools of differential geometry on our side. Some metric spaces $(X,d)$ allow us to define geodesics, permitting us to compare geodesic…
For locally finite CAT(0) cube complexes it is known that they are injectively metrizable choosing the $l_\infty$-norm on each cube. In this paper we show that cube complexes which are injective with respect to this metric are always…
Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of…
We study geodesics on the parameter manifold, for systems exhibiting second order classical and quantum phase transitions. The coupled non-linear geodesic equations are solved numerically for a variety of models which show such phase…
We construct a family of finite 2-complexes whose universal covers are CAT(0) and have polynomial divergence of desired degree. This answers a question of Gersten, namely whether such CAT(0) complexes exist.
Quadric complexes are square complexes satisfying a certain combinatorial nonpositive curvature condition. These complexes generalize 2-dimensional CAT(0) cube complexes and are a square analog of systolic complexes. We introduce and study…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
How do we move a robot efficiently from one position to another? To answer this question, we need to understand its configuration space, a 'map' where we can find every possible position of the robot. Unfortunately, these maps are very…
Geodesics deviation equation (GDE) is itroduced. In "adiabatic" approximation exact solution of the GDE if found. Perturbation theory in general case is formulated. Geometrical criterion of local instability which may lead to chaos is…
The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…
Geodesic metric spaces support a variety of averaging constructions for given finite sets. Computing such averages has generated extensive interest in diverse disciplines. Here we consider the inverse problem of recognizing computationally…