A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes

DOI10.4230/LIPIcs.ICALP.2018.78zbMath1474.68423arXiv1710.09932MaRDI QIDQ5002757

Koyo Hayashi

Publication date: 28 July 2021

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

zbMATH Keywords

CAT(0) spacegeodesiccubical complex

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Old and new challenges in Hadamard spaces, Shortest paths and convex hulls in 2D complexes with non-positive curvature, Distance and routing labeling schemes for cube-free median graphs, Unnamed Item

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
• 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