Abstract
We discuss a technical problem arising in the motion planning algorithm of Kedem and Sharir [KS], and propose a way to overcome it without increasing the asymptotic complexity of the algorithm.
Original language | English |
---|---|
Pages (from-to) | 227-239 |
Number of pages | 13 |
Journal | Discrete and Computational Geometry |
Volume | 17 |
Issue number | 2 |
DOIs | |
State | Published - 1 Jan 1997 |