Abstract
When robot finger probes are used to recognize objects,m-1 probes are necessary and sufficient to identify an object with a fixed orientation and position among a set ofm convex planarn-sided objects. An algorithm is presented to preprocess a set of objects for efficient probing, together with a probing scheme and algorithms to delete objects from or to insert objects into the set.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Belleville P, Shermer TC (1993) Probing Polygons minimally is hard. Comput Geom. Theory Appl 2: 255–265.
Bernstein HJ (1986) Determining the shape of a convexn-sided polygon by using 2n+k tactile probes. Inf Process Lett 22: 255–260
Cole, R, Yap CK (1987) Shape from probing. J Algorithms 8: 19–38
Lyons KA (1988) An efficient algorithm for identifying objects using robot probes. MSc Thesis, Queen's University
Natarajan BK (1987) On detecting the orientation of polygons and polyhedra. In: Proc 3rd Annual Symposium on Computational Geometry, Waterloo, Ontario.
Skiena SS (1988) Geometric probing. Tech Rep UIUCDCS-R-88-1425, Department of Computer Science., University of Illinois at Urbana-Champaign
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lyons, K.A., Rappaport, D. An efficient algorithm for identifying objects using robot probes. The Visual Computer 10, 452–458 (1994). https://doi.org/10.1007/BF01910635
Issue Date:
DOI: https://doi.org/10.1007/BF01910635