Geodesics in CAT(0) cubical complexes

DOI10.1016/j.aam.2011.06.004zbMath1275.05055arXiv1101.2428OpenAlexW1646601689WikidataQ57434013 ScholiaQ57434013MaRDI QIDQ651054

Megan Owen, Seth Sullivant, Federico Ardila

Publication date: 8 December 2011

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.2428

zbMATH Keywords

geodesicpartially ordered setCAT(0) cubical complexreconfigurable systemtouring problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Polyhedral manifolds (52B70)

Related Items (26)

Medians in median graphs and their cube complexes in linear time ⋮ A compact representation for minimizers of \(k\)-submodular functions ⋮ Dual equivalence graphs and CAT(0) combinatorics ⋮ ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE ⋮ A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes ⋮ Wolfowitz’s theorem and consensus algorithms in Hadamard spaces ⋮ Collapsibility of CAT(0) spaces ⋮ A counterexample to Thiagarajan's conjecture on regular event structures ⋮ Old and new challenges in Hadamard spaces ⋮ The configuration space of a robotic arm over a graph ⋮ Topology of complements of skeletons ⋮ The Configuration Space of a Robotic Arm in a Tunnel ⋮ Shortest paths and convex hulls in 2D complexes with non-positive curvature ⋮ Relating CAT(0) cubical complexes and flag simplicial complexes ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ The tame automorphism group of an affine quadric threefold acting on a square complex ⋮ A nonpositive curvature property of modular semilattices ⋮ A note on the unsolvability of the weighted region shortest path problem ⋮ A compact representation for modular semilattices and its applications ⋮ A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) ⋮ Polyhedral computational geometry for averaging metric phylogenetic trees ⋮ Directed Homotopy in Non-Positively Curved Spaces ⋮ Enumerating maximal consistent closed sets in closure systems ⋮ Reconstructing \(d\)-manifold subcomplexes of cubes from their \((\lfloor d/2\rfloor+1)\)-skeletons

Uses Software

• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest path problem in rectangular complexes of global nonpositive curvature
• Property \(A\) and \(\text{CAT}(0)\) cube complexes.
• The geometry of cube complexes and the complexity of their fundamental groups
• Geometry of the space of phylogenetic trees
• Order dimension, strong Bruhat order and lattice properties for posets
• Polyhedral computational geometry for averaging metric phylogenetic trees
• The geometry and topology of reconfiguration
• A decomposition theorem for partially ordered sets
• Nonpositive Curvature and Pareto Optimal Coordination of Robots
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Ends of Group Pairs and Non-Positively Curved Cube Complexes
• New results on shortest paths in three dimensions

This page was built for publication: Geodesics in CAT(0) cubical complexes