On critical orientations in the Kedem-Sharir motion planning algorithm

K. Kedem; M. Sharir; S. Toledo

doi:10.1007/BF02770875

On critical orientations in the Kedem-Sharir motion planning algorithm

K. Kedem
, M. Sharir
, S. Toledo

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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	https://doi.org/10.1007/BF02770875
State	Published - 1 Jan 1997

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1007/BF02770875

Cite this

@article{db8ddb61fb104f8f881d628377a17aba,

title = "On critical orientations in the Kedem-Sharir motion planning algorithm",

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.",

author = "K. Kedem and M. Sharir and S. Toledo",

year = "1997",

month = jan,

day = "1",

doi = "10.1007/BF02770875",

language = "English",

volume = "17",

pages = "227--239",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - On critical orientations in the Kedem-Sharir motion planning algorithm

AU - Kedem, K.

AU - Sharir, M.

AU - Toledo, S.

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0031542174

U2 - 10.1007/BF02770875

DO - 10.1007/BF02770875

M3 - Article

AN - SCOPUS:0031542174

SN - 0179-5376

VL - 17

SP - 227

EP - 239

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 2

ER -

On critical orientations in the Kedem-Sharir motion planning algorithm

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this