## Abstract

We study several variants of the problem of moving a convex polytope K, with n edges, in three dimensions through a flat rectangular (and sometimes more general) window. Specifically: (i) We study variants where the motion is restricted to translations only, discuss situations where such a motion can be reduced to sliding (translation in a fixed direction), and present efficient algorithms for those variants, which run in time close to O(n^{8}/^{3}). (ii) We consider the case of a gate (an unbounded window with two parallel infinite edges), and show that K can pass through such a window, by any collision-free rigid motion, iff it can slide through it, an observation that leads to an efficient algorithm for this variant too. (iii) We consider arbitrary compact convex windows, and show that if K can pass through such a window W (by any motion) then K can slide through a slab of width equal to the diameter of W. (iv) We show that if a purely translational motion for K through a rectangular window W exists, then K can also slide through W keeping the same orientation as in the translational motion. For a given fixed orientation of K we can determine in linear time whether K can translate (and hence slide) through W keeping the given orientation, and if so plan the motion, also in linear time. (v) We give an example of a polytope that cannot pass through a certain window by translations only, but can do so when rotations are allowed. (vi) We study the case of a circular window W, and show that, for the regular tetrahedron K of edge length 1, there are two thresholds 1 > δ_{1} ≈ 0.901388 > δ_{2} ≈ 0.895611, such that (a) K can slide through W if the diameter d of W is ≥ 1, (b) K cannot slide through W but can pass through it by a purely translational motion when δ_{1} ≤ d < 1, (c) K cannot pass through W by a purely translational motion but can do it when rotations are allowed when δ_{2} ≤ d < δ1, and (d) K cannot pass through W at all when d < δ_{2}. (vii) Finally, we explore the general setup, where we want to plan a general motion (with all six degrees of freedom) for K through a rectangular window W, and present an efficient algorithm for this problem, with running time close to O(n^{4}).

Original language | English |
---|---|

Title of host publication | 37th International Symposium on Computational Geometry, SoCG 2021 |

Editors | Kevin Buchin, Eric Colin de Verdiere |

Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |

ISBN (Electronic) | 9783959771849 |

DOIs | |

State | Published - 1 Jun 2021 |

Event | 37th International Symposium on Computational Geometry, SoCG 2021 - Virtual, Buffalo, United States Duration: 7 Jun 2021 → 11 Jun 2021 |

### Publication series

Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Volume | 189 |

ISSN (Print) | 1868-8969 |

### Conference

Conference | 37th International Symposium on Computational Geometry, SoCG 2021 |
---|---|

Country/Territory | United States |

City | Virtual, Buffalo |

Period | 7/06/21 → 11/06/21 |

### Funding

Funders | Funder number |
---|---|

Blavatnik Computer Science Research Fund | G-1367-407.6/2016, 260/18 |

Blavatnik Research Fund in Computer Science | |

US-Israel-BSF | 2019754 |

National Science Foundation | |

German-Israeli Foundation for Scientific Research and Development | |

Israel Science Foundation | 1736/19 |

Tel Aviv University | |

Ministry of Science and Technology, Israel | 103129 |

## Keywords

- Convex polytopes in 3D
- Motion planning