Geometric sensing of known planar shapes

International Journal of Robotics Research

Volumn 15, Issue 4, 1996, Pages 365-392

  Jia, Van Bin ^a   Erdmann, Michael ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBLEM SOLVING; SENSITIVITY ANALYSIS;

DISCRIMINATING SET; PLANAR SHAPES; POLYGON; SENSING BY INSCRIPTION; SENSING BY POINT SAMPLING;

INDUSTRIAL ROBOTS;

EID: 0030211999     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/027836499601500405     Document Type: Article

References (57)

1. Arkin, E. M., Chew, P., Huttenlocher, D. P., Kedem, K., and Mitchell, J. S. B. 1991. An efficiently computable metric for comparing polygonal shapes. IEEE Trans. on Pattern Anal. Machine Intell. 13(3):209-216.
2. Arkin, E. M., Meijer, H., Mitchell, J. S. B., Rappaport, D., and Skiena, S. S. 1993a. Decision trees for geometric models. Proceedings of the Ninth Annual Symposium on Computational Geometry, San Diego, CA, pp. 369-378.
3. Arkin, E. M., Belleville, P., Mitchell, J. S. B., Mount, D., Romanik, K., Saltzberg, S., and Souvaine, D. 1993b. Testing simple polygons. Proceedings of the Fifth Canadian Conference on Computational Geometry.
4. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. 1992. Proof verification and intractability of approximation problems. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, pp. 14-23.
5. Avnaim, F., and Boissonnat, J. D. 1988. Polygon placement under translation and rotation. Technical Report 889, INRIA Sophia-Antipolis.
6. Baker, B. S., Fortune, S. J., and Mahaney, S. R. 1986. Polygon containment under translation. J. Algorithms 7(4):532-548.
7. Bellare, M., Goldwasser, S., Lund, G., and Russell, A. 1993. Efficient probabilistically checkable proofs and applications to approximation. Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, pp. 294-304.
8. Belleville, P., and Shermer, T. C. 1993. Probing polygons minimally is hard. Comp. Geometry: Theory Applications 2(5):255-265.
9. Boissonnat, J. D., and Yvinec, M. 1992. Probing a scene of nonconvex polyhedra. Algorithmica 8(3):321-342.
10. Brost, R. C. 1988. Automatic grasp planning in the presence of uncertainty. Int. J. Robot. Res. 7(1):3-17.
11. Canny, J. F., and Goldberg, K. Y. 1993. A "RISC" paradigm for industrial robotics. Technical Report ESRC 93-4, University of California at Berkeley.
12. Chazelle, B. 1983. The polygon containment problem. In Preparata, F. P. (ed.), Advances in Computing Research. Greenwich, CT: Jai Press Inc., pp. 1-32.
13. Chazelle, B., and Edelsbrunner, H. 1992. An optimal algorithm for intersecting line segments in the plane. J. ACM 39(1):1-54.
14. Chen, H. H. 1991. Pose determination from line-to-plane correspondences: Existence condition and closed-form solutions. IEEE Trans. Pattern Anal. and Machine Intell. 13(6):530-541.
15. Chvátal, V. 1979. A greedy heuristic for the set-covering problem. Math. Operations Res. 4(3):233-235.
16. Cole, R., and Yap, C. K. 1987. Shape from probing. J. Algorithms 8(1):19-38.
17. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1990. Introduction to Algorithms. New York: McGraw-Hill.
18. Dobkin, D., Edelsbrunner, H., and Yap, C. K. 1986. Probing convex polytopes. Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, CA, pp. 424-432.
19. Donald, B. R., Jennings, J., and Rus, D. 1993. Towards a theory of information invariants for cooperating autonomous mobile robots. Sixth International Symposium on Robotics Research, Hidden Valley, PA.
20. Edelsbrunner, H., and Guibas, L. J. 1986. Topologically sweeping an arrangement. Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, CA, pp. 389-403.
21. Erdmann, M. 1993. Understanding action and sensing by designing action-based sensors. Sixth International Symposium on Robotics Research, Hidden Valley, PA.
22. Erdmann, M., and Mason, M. 1988. An exploration of sensorless manipulation. IEEE J. Robot. Automation 4(4):369-379.
23. Fortune, S. 1985. Fast algorithms for polygon containment. In Brauer, W. (ed.), Automata. Languages and Programming, New York: Springer-Verlag, pp. 189-198.
24. Fortune, S. 1987. A sweepline algorithm for Voronoi diagrams. Algorithmica 2:153-174.
25. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman & Company.
26. Gaston, P. C., and Lozano-Pérez, T. 1984. Tactile recognition and localization using object models: The case of polyhedra on a plane. IEEE Trans. Pattern Anal. Machine Intell. 6(3):257-266.
27. Goldberg, K. Y., and Mason, M. T. 1990. Bayesian grasping. Proceedings of the 1990 IEEE International Conference on Robotics and Automation, Cincinnati, OH, pp. 1264-1269.
28. Govindan, R., and Rao, A. S. 1994. Optimal strategies for recognizing polygonal parts. Proceedings of the 1994 IEEE Int. Conference on Robot, and Automation, San Diego, CA, pp. 3564-3569.
29. Graham, R. L., Knuth, D. E., and Patashnik, O. 1989. Concrete Mathematics: A Foundation for Computer Science. Reading, MA: Addison-Wesley.
30. Grimson, W. E. L. 1990. Object Recognition by Computer: the Role of Geometric Constraints. Cambridge, MA: MIT Press.
31. Grossman, D. D., and Blasgen, M. W. 1975. Orienting mechanical parts by computer-controlled manipulator. IEEE Trans. Sys. Man Cybernet. 5(5):561-565.
32. Jia, Y.-B., and Erdmann, M. 1994a. Sensing polygon poses by inscription. Proceedings of the 1994 IEEE International Conference on Robotics and Automation, San Diego, CA, pp. 1642-1649.
33. Jia, Y.-B., and Erdmann, M. 1994b. The complexity of sensing by point sampling. Proceedings of the First Workshop on the Algorithmic Foundations of Robotics. Boston: A. K. Peters.
34. Johnson, D. S. 1974. Approximation algorithms for combinatorial problems. J. Computer Sys. Sci. 9(3):256-278.
35. Johnson, D. S. 1981. The NP-completeness column: An ongoing guide. J. Algorithms 2(4):393-405.
36. Karp, R. M. 1972. Reducibility among combinatorial problems. In Miller, R. E., and Thatcher, J. W. (eds.), Complexity of Computer Computations. New York: Plenum Press.
37. Kemmotsu, K., and Kanade, T. 1993. Uncertainty in object pose determination with three light-stripe range measurements. Technical Report CMU-CS-93-100, CMU School of Computer Science.
38. Kirkpatrick, D. G. 1979. Efficient computation of continuous skeletons. Proceedings of the Twentieth Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, pp. 18-27.
39. Kolaitis, P. G., and Thakur, M. N. 1991. Approximation properties of NP minimization classes. Proceedings of the 6th Conference on Structure in Complexity Theory, pp. 353-366.
40. Li, S.-Y. R. 1988. Reconstruction of polygons from projections. Information Process. Lett. 28(5):235-240.
41. Lindenbaum, M., and Bruckstein, A. 1992. Parallel strategies for geometric probing. J. Algorithms 13(2):320-349.
42. Linnainmaa, S., Harwood, D., and Davis, L. S. 1988. Pose determination of a three-dimensional object using triangle pairs. IEEE Trans. Pattern Anal. Machine Intell. 10(5):634-647.
43. Lovász, L. 1975. On the ratio of optimal integral and fractional covers. Discrete Math. 13(4):383-390.
44. Lund, C., and Yannakakis, M. 1993. On the hardness of approximation minimization problems. Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, pp. 286-293.
45. Mumford, D. 1987. The problem of robust shape descriptors. Proceedings of the First International Conference on Computer Vision, London, pp. 602-606.
46. Natarajan, B. K. 1987. On detecting the orientation of polygons and polyhedra. Proceedings of the 3rd Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, pp. 146-152.
47. Nievergelt, J., and Preparata, F. P. 1982. Plane-sweep algorithms for intersecting geometric figures. Comm. of the ACM 25(10):739-747.
48. Preparata, F. P., and Shamos, M. I. 1988. Computational Geometry: An Introduction. New York: Springer-Verlag.
49. Rao, A. S., and Goldberg, K. Y. 1993. Placing registration marks. Proceedings of the 1993 IEEE International Conference on Robotics and Automation, Atlanta, GA, pp. 161-167.
50. Rao, A. S., and Goldberg, K. Y. 1994. Shape from diameter: Recognizing polygonal parts with a parallel-jaw gripper. Int. J. Robot. Res. 13(1):16-37.
51. Romanik, K. 1992. Approximate testing theory. Technical Report CS-TR-2947/UMIACS-TR-92-89, University of Maryland, College Park, MD.
52. Romanik, K., and Salzberg, S. 1992. Testing orthogonal shapes. Proceedings of the Fourth Canadian Conference on Computational Geometry, pp. 216-222.
53. Siegel, D. M. 1991. Finding the pose of an object in a hand. Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, pp. 406-411.
54. Sinden, F. W. 1985. Shape information from rotated scans. IEEE Trans. Pattern Anal. Machine Intell. 7(6):726-730.
55. Skiena, S. S. 1989. Problems in geometric probing. Algorithmica 4(4):599-605.
56. Wallack, A. S., Canny, J. F., and Manocha, D. 1993. Object localization using crossbeam sensing. Proceedings of the 1993 IEEE International Conference on Robotics and Automation, Atlanta, GA, pp. 692-699.
57. Yap, C. K. 1987. An O(n log n) algorithm for the Voronoi diagram of the set of simple curve segments. Discrete Computational Geometry 2(4):365-393.