Motion planning in tori
几何拓扑
2008-12-31 v3 代数拓扑
摘要
Let X be a subcomplex of the standard CW-decomposition of the n-dimensional torus. We exhibit an explicit optimal motion planning algorithm for X. This construction is used to calculate the topological complexity of complements of general position arrangements and Eilenberg-Mac Lane spaces associated to right-angled Artin groups.
引用
@article{arxiv.math/0703069,
title = {Motion planning in tori},
author = {Daniel C. Cohen and Goderdzi Pruidze},
journal= {arXiv preprint arXiv:math/0703069},
year = {2008}
}
备注
Results extended to arbitrary subcomplexes of tori. Results on products of even spheres added