Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions.
Discrete & computational geometry, Tome 14 (1995) no. 3, pp. 385-410
Voir la notice de l'article provenant de la source European Digital Mathematics Library
Mots-clés :
combinatorial complexity of a cell, algebraic surface patches, motion planning, robot systems
@article{DCG_1995__14_3_131410,
author = {M. Sharir and D. Halperin},
title = {Almost {Tight} {Upper} {Bounds} for the {Single} {Cell} and {Zone} {Problems} in {Three} {Dimensions.}},
journal = {Discrete & computational geometry},
pages = {385--410},
publisher = {mathdoc},
volume = {14},
number = {3},
year = {1995},
zbl = {0839.93056},
url = {http://geodesic.mathdoc.fr/item/DCG_1995__14_3_131410/}
}
TY - JOUR AU - M. Sharir AU - D. Halperin TI - Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. JO - Discrete & computational geometry PY - 1995 SP - 385 EP - 410 VL - 14 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DCG_1995__14_3_131410/ ID - DCG_1995__14_3_131410 ER -
M. Sharir; D. Halperin. Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions.. Discrete & computational geometry, Tome 14 (1995) no. 3, pp. 385-410. http://geodesic.mathdoc.fr/item/DCG_1995__14_3_131410/