A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
From MaRDI portal
Publication:2664104
DOI10.1007/s00454-019-00154-2zbMath1474.68422OpenAlexW2990372584WikidataQ126653137 ScholiaQ126653137MaRDI QIDQ2664104
Publication date: 20 April 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9082/
Related Items
Medians in median graphs and their cube complexes in linear time ⋮ A nonpositive curvature property of modular semilattices ⋮ Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geodesics in CAT(0) cubical complexes
- Median graphs, parallelism and posets
- Shortest path problem in rectangular complexes of global nonpositive curvature
- Small cancellation theory and automatic groups. II
- Petri nets, event structures and domains. I
- Superextensions and the depth of median graphs
- The structure of median graphs
- Geometry of the space of phylogenetic trees
- Graphs of some CAT(0) complexes
- Polyhedral computational geometry for averaging metric phylogenetic trees
- The geometry and topology of reconfiguration
- Convex analysis and optimization in Hadamard spaces
- Computing Geodesic Distances in Tree Space
- Nonpositive Curvature and Pareto Optimal Coordination of Robots
- On Shortest Paths Amidst Convex Polyhedra
- Ends of Group Pairs and Non-Positively Curved Cube Complexes
- New results on shortest paths in three dimensions