-
2
-
-
0026121005
-
An efficiently computable metric for comparing polygonal shapes
-
E.M. Arkin, L.P. Chew, D.P. Huttenlocher, K. Kedem, J.S.B. Mitchell, An efficiently computable metric for comparing polygonal shapes, IEEE Trans. Pattern Anal. Mach. Intell. 13 (1991) 209-216.
-
(1991)
IEEE Trans. Pattern Anal. Mach. Intell.
, vol.13
, pp. 209-216
-
-
Arkin, E.M.1
Chew, L.P.2
Huttenlocher, D.P.3
Kedem, K.4
Mitchell, J.S.B.5
-
3
-
-
0026136157
-
Blanche - An experiment in guidance and navigation of an autonomous robot vehicle
-
I.J. Cox, Blanche - an experiment in guidance and navigation of an autonomous robot vehicle, IEEE Trans. Robot. Automat. 7 (2) (1991) 193-204.
-
(1991)
IEEE Trans. Robot. Automat.
, vol.7
, Issue.2
, pp. 193-204
-
-
Cox, I.J.1
-
5
-
-
0002511132
-
The robot localization problem
-
K. Goldberg, D. Halperin, J.-C. Latombe, R. Wilson (Eds.)
-
L.J. Guibas, R. Motwani, P. Raghavan, The robot localization problem, in: K. Goldberg, D. Halperin, J.-C. Latombe, R. Wilson (Eds.), Algorithmic Foundations of Robotics A.K. Peters, 1995, pp. 269 -282. http://theory.stanford.edu/people/motwani/postscripts/localiz.ps.Z.
-
(1995)
Algorithmic Foundations of Robotics A.K. Peters
, pp. 269-282
-
-
Guibas, L.J.1
Motwani, R.2
Raghavan, P.3
-
6
-
-
0005089781
-
A sharper complexity bound for the robot localization problem
-
Department of Computer Science I, University of Würzburg, June
-
O. Karch, A sharper complexity bound for the robot localization problem, Technical Report No. 139, Department of Computer Science I, University of Würzburg, June 1996. http://www-infol.informatik.uni-wuerzburg.de/publications/karch/tr139.ps.gz.
-
(1996)
Technical Report No. 139
, vol.139
-
-
Karch, O.1
-
7
-
-
0029184961
-
LEDA - A platform for combinatorial and geometric computing
-
K. Mehlhorn, S. Näher, LEDA - a platform for combinatorial and geometric computing, Commun. ACM 38 (1995) 96-102. http://www.mpi-sb.mpg.de/guide/staff/uhrig/ledapub/reports/leda.ps.Z.
-
(1995)
Commun. ACM
, vol.38
, pp. 96-102
-
-
Mehlhorn, K.1
Näher, S.2
-
8
-
-
0041976365
-
A data structure for representing and efficient querying large scenes of geometric objects: MB-trees
-
G. Farin, H. Hagen, H. Noltemeier (Eds.), Springer, Berlin
-
H. Noltemeier, K. Verbarg, C. Zirkelbach, A data structure for representing and efficient querying large scenes of geometric objects: MB-trees, in: G. Farin, H. Hagen, H. Noltemeier (Eds.), Geometric Modelling, Computing Supplement, vol. 8. Springer, Berlin, 1993, pp. 211-226.
-
(1993)
Geometric Modelling, Computing Supplement
, vol.8
, pp. 211-226
-
-
Noltemeier, H.1
Verbarg, K.2
Zirkelbach, C.3
-
9
-
-
0041801666
-
Efficient robot self-localization in simple polygons
-
O. Karch, H. Noltemeier, K. Verbarg (Eds.), University of Würzburg
-
S. Schuierer, Efficient robot self-localization in simple polygons, in: O. Karch, H. Noltemeier, K. Verbarg (Eds.), 13th European Workshop on Computational Geometry (CG '97), University of Würzburg, 1997, pp. 20-22.
-
(1997)
13th European Workshop on Computational Geometry (CG '97)
, pp. 20-22
-
-
Schuierer, S.1
-
11
-
-
0042476972
-
Location estimation and uncertainty analysis for mobile robots
-
I.J. Cox, G.T. Wilfong (Eds.), Springer, Berlin
-
C.M. Wang, Location estimation and uncertainty analysis for mobile robots, in: I.J. Cox, G.T. Wilfong (Eds.), Autonomous Robot Vehicles, Springer, Berlin, 1990.
-
(1990)
Autonomous Robot Vehicles
-
-
Wang, C.M.1
|