Geodesics in CAT(0) cubical complexes
From MaRDI portal
Abstract: We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature and posets with inconsistent pairs. This correspondence also gives an explicit realization of such a complex as the state complex of a reconfigurable system, and a way to embed any interval in the integer lattice cubing of its dimension.
Recommendations
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- The combinatorics of \(\mathrm{CAT}(0)\) cubical complexes
- Shortest path problem in rectangular complexes of global nonpositive curvature
- Moving robots efficiently using the combinatorics of CAT(0) cubical complexes
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Ends of Group Pairs and Non-Positively Curved Cube Complexes
- Geometry of the space of phylogenetic trees
- New results on shortest paths in three dimensions
- Nonpositive Curvature and Pareto Optimal Coordination of Robots
- Order dimension, strong Bruhat order and lattice properties for posets
- Polyhedral computational geometry for averaging metric phylogenetic trees
- Property \(A\) and \(\text{CAT}(0)\) cube complexes.
- Shortest path problem in rectangular complexes of global nonpositive curvature
- The geometry and topology of reconfiguration
- The geometry of cube complexes and the complexity of their fundamental groups
Cited in
(40)- A counterexample to Thiagarajan's conjecture on regular event structures
- The Furstenberg–Poisson boundary and CAT(0) cube complexes
- Medians in median graphs and their cube complexes in linear time
- ON THE WEIGHTS OF END-PAIRS IN N-END CATENOIDS OF GENUS ZERO II
- Reconstructing \(d\)-manifold subcomplexes of cubes from their \((\lfloor d/2\rfloor+1)\)-skeletons
- Weakly Modular Graphs and Nonpositive Curvature
- A compact representation for minimizers of \(k\)-submodular functions
- Geodesic pancyclicity of twisted cubes
- Cross‐ratios on CAT(0) cube complexes and marked length‐spectrum rigidity
- scientific article; zbMATH DE number 6405363 (Why is no real title available?)
- Topology of complements of skeletons
- Moving robots efficiently using the combinatorics of CAT(0) cubical complexes
- Shortest path problem in rectangular complexes of global nonpositive curvature
- The configuration space of a robotic arm over a graph
- A note on the unsolvability of the weighted region shortest path problem
- Enumerating maximal consistent closed sets in closure systems
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- A nonpositive curvature property of modular semilattices
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
- CAT(0) and CAT(-1) fillings of hyperbolic manifolds
- A Proof of Sageev’s Theorem on Hyperplanes in CAT(0) Cubical Complexes
- Relatively geometric actions on CAT$\operatorname{CAT}$(0) cube complexes
- Polyhedral computational geometry for averaging metric phylogenetic trees
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- The combinatorics of \(\mathrm{CAT}(0)\) cubical complexes
- Old and new challenges in Hadamard spaces
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
- Dual equivalence graphs and CAT(0) combinatorics
- Towards control, learning and intelligence in reconfigurable systems
- The configuration space of a robotic arm in a tunnel
- Relating CAT(0) cubical complexes and flag simplicial complexes
- Wolfowitz's theorem and consensus algorithms in Hadamard spaces
- The tame automorphism group of an affine quadric threefold acting on a square complex
- A compact representation for modular semilattices and its applications
- Directed homotopy in non-positively curved spaces
- Collapsibility of CAT(0) spaces
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- CAT(0) is an algorithmic property
- Median sets of isometries in \(\mathrm{CAT}(0)\) cube complexes and some applications
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
This page was built for publication: Geodesics in CAT(0) cubical complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651054)
