Model-based probing strategies for convex polygons
- 1 December 1992
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 2 (4) , 209-221
- https://doi.org/10.1016/0925-7721(92)90023-l
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An efficient algorithm for identifying objects using robot probesThe Visual Computer, 1994
- Interactive reconstruction via geometric probingProceedings of the IEEE, 1992
- Probing convex polygons with half-planesJournal of Algorithms, 1991
- Non-convex contour reconstructionJournal of Symbolic Computation, 1990
- The maximum number of unit distances in a convex n-gonJournal of Combinatorial Theory, Series A, 1990
- An Optimal-Time Algorithm for Slope SelectionSIAM Journal on Computing, 1989
- Reconstruction of polygons from projectionsInformation Processing Letters, 1988
- Shape from probingJournal of Algorithms, 1987
- Determining the shape of a convex n-sided polygon by using 2n + k tactile probesInformation Processing Letters, 1986
- Model-Based Recognition and Localization from Sparse Range or Tactile DataThe International Journal of Robotics Research, 1984