-
1
-
-
0036555876
-
Sensor-based coverage of unknown environments: Incremental construction of morse decompositions
-
Acar, E.U., and Choset, H. 2002. Sensor-based coverage of unknown environments: Incremental construction of morse decompositions, The Int. J. Robotics Research 21(4):345-366.
-
(2002)
The Int. J. Robotics Research
, vol.21
, Issue.4
, pp. 345-366
-
-
Acar, E.U.1
Choset, H.2
-
2
-
-
0001685025
-
Critical points and curvature for embedded polyhedral surfaces
-
Banchoff, T.F. 1970. Critical points and curvature for embedded polyhedral surfaces. American Mathematical Monthly, 77:475-485.
-
(1970)
American Mathematical Monthly
, vol.77
, pp. 475-485
-
-
Banchoff, T.F.1
-
4
-
-
0024123325
-
Constructing roadmaps of semi-algebraic sets I: Completeness
-
Canny, J.F. 1988. Constructing roadmaps of semi-algebraic sets I: Completeness. Artificial Intelligence 37:203-222.
-
(1988)
Artificial Intelligence
, vol.37
, pp. 203-222
-
-
Canny, J.F.1
-
5
-
-
0001372855
-
An opportunistic global path planner
-
Canny, J.F., and Lin, M. 1993. An opportunistic global path planner. Algorithmica 10:102-120.
-
(1993)
Algorithmica
, vol.10
, pp. 102-120
-
-
Canny, J.F.1
Lin, M.2
-
6
-
-
0021475092
-
Convex partition of polyhedra: A lower bound and worst-case optimal algorithm
-
Chazelle, B. 1984. Convex partition of polyhedra: A lower bound and worst-case optimal algorithm. SIAM Journal on Computing 13(3):488-507.
-
(1984)
SIAM Journal on Computing
, vol.13
, Issue.3
, pp. 488-507
-
-
Chazelle, B.1
-
10
-
-
0034818028
-
Hierarchical morse complexes for piecewise linear 2-manifolds
-
Medford, MA
-
Edelsbrunner, H., Harer, J., and Zomorodian, A. 2001. Hierarchical morse complexes for piecewise linear 2-manifolds. ACM Symposium on Computational Geometry, Medford, MA.
-
(2001)
ACM Symposium on Computational Geometry
-
-
Edelsbrunner, H.1
Harer, J.2
Zomorodian, A.3
-
12
-
-
0002910255
-
Morse theory for cell complexes
-
Forman, R. 1998. Morse theory for cell complexes. Advances in Mathematics 134:90-145.
-
(1998)
Advances in Mathematics
, vol.134
, pp. 90-145
-
-
Forman, R.1
-
14
-
-
0033330745
-
An optimal algorithm for euclidean shortest paths in the plane
-
Hershberger, J., and Suri, S. 1999. An optimal algorithm for euclidean shortest paths in the plane. SIAM Journal on Computing 28(6):2215-2256.
-
(1999)
SIAM Journal on Computing
, vol.28
, Issue.6
, pp. 2215-2256
-
-
Hershberger, J.1
Suri, S.2
-
15
-
-
0022122750
-
Collision free trajectory planning using distance transforms
-
Jarvis, R.A. 1985. Collision free trajectory planning using distance transforms. Mech. Eng. Trans. of the IE Aust. ME10:197-191.
-
(1985)
Mech. Eng. Trans. of the IE Aust.
, vol.ME10
, pp. 197-191
-
-
Jarvis, R.A.1
-
16
-
-
0022674420
-
Real-time obstacle avoidance for manipulators and mobile robots
-
Khatib, O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robotics Research 5(1):90-98.
-
(1986)
Int. J. Robotics Research
, vol.5
, Issue.1
, pp. 90-98
-
-
Khatib, O.1
-
17
-
-
0003896351
-
-
Boston, MA: Kluwer Academic Publishers
-
Latombe, J.C. 1991. Robot Motion Planning. Boston, MA: Kluwer Academic Publishers.
-
(1991)
Robot Motion Planning
-
-
Latombe, J.C.1
-
18
-
-
0004190360
-
-
Princeton, New Jersey: Princeton University Press
-
Milnor, J. 1963. Morse Theory. Princeton, New Jersey: Princeton University Press.
-
(1963)
Morse Theory
-
-
Milnor, J.1
-
22
-
-
0347647219
-
On the "piano movers" problem II: General techniques for computing topological properties of real algebraic manifolds
-
Schwartz, J.T., and Sharir, M. 1983. On the "piano movers" problem II: General techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics 4(1):298-351.
-
(1983)
Advances in Applied Mathematics
, vol.4
, Issue.1
, pp. 298-351
-
-
Schwartz, J.T.1
Sharir, M.2
-
24
-
-
0025376782
-
The tethered robot problem
-
Sinden, F.W. 1990. The tethered robot problem. Int. J. Robotics Research 9:122-133.
-
(1990)
Int. J. Robotics Research
, vol.9
, pp. 122-133
-
-
Sinden, F.W.1
-
27
-
-
0032651821
-
Shortest path planning for a tethered robot or an anchored cable
-
Detroit, MI
-
Xavier, P.G. 1999. Shortest path planning for a tethered robot or an anchored cable. In Proc. of IEEE ICRA, Detroit, MI, 2:1011-1017.
-
(1999)
Proc. of IEEE ICRA
, vol.2
, pp. 1011-1017
-
-
Xavier, P.G.1
|